./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:37:43,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:37:44,007 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-02 12:37:44,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:37:44,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:37:44,054 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:37:44,055 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:37:44,055 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:37:44,056 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:37:44,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:37:44,058 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:37:44,058 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:37:44,058 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:37:44,060 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:37:44,061 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:37:44,061 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:37:44,062 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:37:44,062 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:37:44,062 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:37:44,062 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:37:44,063 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:37:44,067 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:37:44,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 12:37:44,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 12:37:44,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:37:44,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 12:37:44,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:37:44,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 12:37:44,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:37:44,069 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 12:37:44,070 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 12:37:44,070 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 12:37:44,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:37:44,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 12:37:44,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:37:44,072 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 12:37:44,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 12:37:44,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:37:44,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:37:44,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:37:44,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:37:44,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:37:44,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:37:44,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:37:44,074 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:37:44,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:37:44,075 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:37:44,075 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:37:44,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:37:44,076 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 [2024-11-02 12:37:44,382 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:37:44,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:37:44,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:37:44,424 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:37:44,425 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:37:44,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i Unable to find full path for "g++" [2024-11-02 12:37:46,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:37:47,192 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:37:47,193 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i [2024-11-02 12:37:47,212 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/data/7560d0aa2/e2bac45477f7490b8a56c6edd6415290/FLAG54968a27b [2024-11-02 12:37:47,236 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/data/7560d0aa2/e2bac45477f7490b8a56c6edd6415290 [2024-11-02 12:37:47,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:37:47,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:37:47,244 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:37:47,246 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:37:47,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:37:47,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:37:47" (1/1) ... [2024-11-02 12:37:47,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1fd634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:47, skipping insertion in model container [2024-11-02 12:37:47,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:37:47" (1/1) ... [2024-11-02 12:37:47,340 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:37:47,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:37:48,021 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:37:48,139 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:37:48,196 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:37:48,196 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48 WrapperNode [2024-11-02 12:37:48,197 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:37:48,198 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:37:48,198 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:37:48,199 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:37:48,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,302 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 265 [2024-11-02 12:37:48,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:37:48,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:37:48,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:37:48,307 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:37:48,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,385 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,400 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:37:48,401 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:37:48,402 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:37:48,402 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:37:48,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (1/1) ... [2024-11-02 12:37:48,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:37:48,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:37:48,467 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:37:48,472 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:37:48,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-02 12:37:48,512 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 12:37:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-02 12:37:48,513 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-02 12:37:48,513 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-02 12:37:48,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-02 12:37:48,515 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-02 12:37:48,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-02 12:37:48,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 12:37:48,516 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-02 12:37:48,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:37:48,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:37:48,518 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-02 12:37:48,778 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:37:48,781 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:37:49,515 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-02 12:37:49,516 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:37:50,015 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:37:50,016 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-02 12:37:50,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:37:50 BoogieIcfgContainer [2024-11-02 12:37:50,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:37:50,020 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:37:50,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:37:50,024 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:37:50,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:37:47" (1/3) ... [2024-11-02 12:37:50,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3fe2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:37:50, skipping insertion in model container [2024-11-02 12:37:50,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:37:48" (2/3) ... [2024-11-02 12:37:50,026 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3fe2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:37:50, skipping insertion in model container [2024-11-02 12:37:50,026 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:37:50" (3/3) ... [2024-11-02 12:37:50,027 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_tso.oepc.i [2024-11-02 12:37:50,047 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:37:50,047 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-02 12:37:50,047 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-02 12:37:50,162 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-02 12:37:50,193 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 47 transitions, 106 flow [2024-11-02 12:37:50,676 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 8395 states, 8384 states have (on average 3.68368320610687) internal successors, (30884), 8394 states have internal predecessors, (30884), 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-11-02 12:37:50,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:37:50,733 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@51b059b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:37:50,734 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2024-11-02 12:37:50,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 8395 states, 8384 states have (on average 3.68368320610687) internal successors, (30884), 8394 states have internal predecessors, (30884), 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-11-02 12:37:50,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-02 12:37:50,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:37:50,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-02 12:37:50,854 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:37:50,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:37:50,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1131004552, now seen corresponding path program 1 times [2024-11-02 12:37:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:37:50,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567403098] [2024-11-02 12:37:50,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:37:50,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:37:51,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:37:51,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:37:51,486 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:37:51,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567403098] [2024-11-02 12:37:51,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567403098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:37:51,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:37:51,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:37:51,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454409845] [2024-11-02 12:37:51,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:37:51,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:37:51,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:37:51,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:37:51,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:37:51,544 INFO L87 Difference]: Start difference. First operand has 8395 states, 8384 states have (on average 3.68368320610687) internal successors, (30884), 8394 states have internal predecessors, (30884), 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-02 12:37:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:37:52,004 INFO L93 Difference]: Finished difference Result 10159 states and 36960 transitions. [2024-11-02 12:37:52,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:37:52,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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) Word has length 6 [2024-11-02 12:37:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:37:52,118 INFO L225 Difference]: With dead ends: 10159 [2024-11-02 12:37:52,118 INFO L226 Difference]: Without dead ends: 6848 [2024-11-02 12:37:52,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:37:52,142 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:37:52,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 27 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:37:52,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6848 states. [2024-11-02 12:37:52,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6848 to 6848. [2024-11-02 12:37:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6848 states, 6843 states have (on average 3.5256466462078038) internal successors, (24126), 6847 states have internal predecessors, (24126), 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-11-02 12:37:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6848 states to 6848 states and 24126 transitions. [2024-11-02 12:37:52,577 INFO L78 Accepts]: Start accepts. Automaton has 6848 states and 24126 transitions. Word has length 6 [2024-11-02 12:37:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:37:52,578 INFO L471 AbstractCegarLoop]: Abstraction has 6848 states and 24126 transitions. [2024-11-02 12:37:52,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-11-02 12:37:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 6848 states and 24126 transitions. [2024-11-02 12:37:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:37:52,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:37:52,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:37:52,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:37:52,580 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:37:52,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:37:52,581 INFO L85 PathProgramCache]: Analyzing trace with hash 267493635, now seen corresponding path program 1 times [2024-11-02 12:37:52,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:37:52,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386152637] [2024-11-02 12:37:52,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:37:52,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:37:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:37:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:37:52,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:37:52,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386152637] [2024-11-02 12:37:52,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386152637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:37:52,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:37:52,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:37:52,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610908563] [2024-11-02 12:37:52,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:37:52,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:37:52,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:37:52,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:37:52,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:37:52,843 INFO L87 Difference]: Start difference. First operand 6848 states and 24126 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-02 12:37:53,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:37:53,088 INFO L93 Difference]: Finished difference Result 6848 states and 24126 transitions. [2024-11-02 12:37:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:37:53,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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) Word has length 8 [2024-11-02 12:37:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:37:53,155 INFO L225 Difference]: With dead ends: 6848 [2024-11-02 12:37:53,156 INFO L226 Difference]: Without dead ends: 5952 [2024-11-02 12:37:53,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:37:53,164 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 24 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:37:53,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 27 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:37:53,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5952 states. [2024-11-02 12:37:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5952 to 5952. [2024-11-02 12:37:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5952 states, 5950 states have (on average 3.5115966386554622) internal successors, (20894), 5951 states have internal predecessors, (20894), 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-11-02 12:37:53,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5952 states to 5952 states and 20894 transitions. [2024-11-02 12:37:53,642 INFO L78 Accepts]: Start accepts. Automaton has 5952 states and 20894 transitions. Word has length 8 [2024-11-02 12:37:53,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:37:53,643 INFO L471 AbstractCegarLoop]: Abstraction has 5952 states and 20894 transitions. [2024-11-02 12:37:53,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-02 12:37:53,644 INFO L276 IsEmpty]: Start isEmpty. Operand 5952 states and 20894 transitions. [2024-11-02 12:37:53,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 12:37:53,653 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:37:53,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:37:53,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 12:37:53,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:37:53,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:37:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash -285336126, now seen corresponding path program 1 times [2024-11-02 12:37:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:37:53,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967271055] [2024-11-02 12:37:53,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:37:53,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:37:53,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:37:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:37:53,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:37:53,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967271055] [2024-11-02 12:37:53,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967271055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:37:53,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:37:53,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:37:53,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104497699] [2024-11-02 12:37:53,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:37:53,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:37:53,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:37:53,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:37:53,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:37:53,765 INFO L87 Difference]: Start difference. First operand 5952 states and 20894 transitions. Second operand has 3 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-11-02 12:37:53,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:37:53,936 INFO L93 Difference]: Finished difference Result 5952 states and 20894 transitions. [2024-11-02 12:37:53,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:37:53,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 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) Word has length 15 [2024-11-02 12:37:53,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:37:53,987 INFO L225 Difference]: With dead ends: 5952 [2024-11-02 12:37:53,987 INFO L226 Difference]: Without dead ends: 4608 [2024-11-02 12:37:53,992 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:37:53,994 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:37:53,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 13 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:37:54,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2024-11-02 12:37:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 4608. [2024-11-02 12:37:54,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4608 states, 4607 states have (on average 3.482960711960061) internal successors, (16046), 4607 states have internal predecessors, (16046), 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-11-02 12:37:54,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4608 states to 4608 states and 16046 transitions. [2024-11-02 12:37:54,269 INFO L78 Accepts]: Start accepts. Automaton has 4608 states and 16046 transitions. Word has length 15 [2024-11-02 12:37:54,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:37:54,270 INFO L471 AbstractCegarLoop]: Abstraction has 4608 states and 16046 transitions. [2024-11-02 12:37:54,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-11-02 12:37:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 4608 states and 16046 transitions. [2024-11-02 12:37:54,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 12:37:54,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:37:54,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:37:54,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 12:37:54,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:37:54,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:37:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash -285334547, now seen corresponding path program 1 times [2024-11-02 12:37:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:37:54,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851832455] [2024-11-02 12:37:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:37:54,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:37:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:37:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:37:55,452 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:37:55,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851832455] [2024-11-02 12:37:55,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851832455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:37:55,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:37:55,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:37:55,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070643651] [2024-11-02 12:37:55,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:37:55,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:37:55,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:37:55,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:37:55,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:37:55,454 INFO L87 Difference]: Start difference. First operand 4608 states and 16046 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-11-02 12:37:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:37:56,030 INFO L93 Difference]: Finished difference Result 6008 states and 20711 transitions. [2024-11-02 12:37:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:37:56,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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) Word has length 15 [2024-11-02 12:37:56,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:37:56,066 INFO L225 Difference]: With dead ends: 6008 [2024-11-02 12:37:56,066 INFO L226 Difference]: Without dead ends: 3768 [2024-11-02 12:37:56,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:37:56,076 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 103 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 12:37:56,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 84 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 12:37:56,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3768 states. [2024-11-02 12:37:56,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3768 to 3768. [2024-11-02 12:37:56,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3768 states, 3767 states have (on average 3.4273958056809133) internal successors, (12911), 3767 states have internal predecessors, (12911), 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-11-02 12:37:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3768 states to 3768 states and 12911 transitions. [2024-11-02 12:37:56,299 INFO L78 Accepts]: Start accepts. Automaton has 3768 states and 12911 transitions. Word has length 15 [2024-11-02 12:37:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:37:56,300 INFO L471 AbstractCegarLoop]: Abstraction has 3768 states and 12911 transitions. [2024-11-02 12:37:56,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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-11-02 12:37:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 3768 states and 12911 transitions. [2024-11-02 12:37:56,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-02 12:37:56,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:37:56,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:37:56,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 12:37:56,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:37:56,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:37:56,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1318122854, now seen corresponding path program 1 times [2024-11-02 12:37:56,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:37:56,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289995176] [2024-11-02 12:37:56,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:37:56,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:37:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:37:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:37:57,366 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:37:57,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289995176] [2024-11-02 12:37:57,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289995176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:37:57,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:37:57,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:37:57,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030798299] [2024-11-02 12:37:57,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:37:57,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:37:57,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:37:57,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:37:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:37:57,369 INFO L87 Difference]: Start difference. First operand 3768 states and 12911 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:37:57,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:37:57,968 INFO L93 Difference]: Finished difference Result 4643 states and 15761 transitions. [2024-11-02 12:37:57,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:37:57,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-02 12:37:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:37:58,000 INFO L225 Difference]: With dead ends: 4643 [2024-11-02 12:37:58,000 INFO L226 Difference]: Without dead ends: 3243 [2024-11-02 12:37:58,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:37:58,006 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 71 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 12:37:58,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 104 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 12:37:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2024-11-02 12:37:58,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 3243. [2024-11-02 12:37:58,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3243 states, 3242 states have (on average 3.390191239975324) internal successors, (10991), 3242 states have internal predecessors, (10991), 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-11-02 12:37:58,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3243 states to 3243 states and 10991 transitions. [2024-11-02 12:37:58,163 INFO L78 Accepts]: Start accepts. Automaton has 3243 states and 10991 transitions. Word has length 18 [2024-11-02 12:37:58,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:37:58,164 INFO L471 AbstractCegarLoop]: Abstraction has 3243 states and 10991 transitions. [2024-11-02 12:37:58,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:37:58,165 INFO L276 IsEmpty]: Start isEmpty. Operand 3243 states and 10991 transitions. [2024-11-02 12:37:58,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-02 12:37:58,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:37:58,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:37:58,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 12:37:58,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:37:58,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:37:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash 596516111, now seen corresponding path program 1 times [2024-11-02 12:37:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:37:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330015204] [2024-11-02 12:37:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:37:58,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:37:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:37:59,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:37:59,041 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:37:59,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330015204] [2024-11-02 12:37:59,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330015204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:37:59,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:37:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:37:59,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051367543] [2024-11-02 12:37:59,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:37:59,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:37:59,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:37:59,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:37:59,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:37:59,051 INFO L87 Difference]: Start difference. First operand 3243 states and 10991 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-11-02 12:37:59,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:37:59,364 INFO L93 Difference]: Finished difference Result 4697 states and 15536 transitions. [2024-11-02 12:37:59,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:37:59,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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) Word has length 21 [2024-11-02 12:37:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:37:59,385 INFO L225 Difference]: With dead ends: 4697 [2024-11-02 12:37:59,385 INFO L226 Difference]: Without dead ends: 2478 [2024-11-02 12:37:59,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:37:59,393 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 57 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:37:59,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 27 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:37:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2024-11-02 12:37:59,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2478. [2024-11-02 12:37:59,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 3.20185708518369) internal successors, (7931), 2477 states have internal predecessors, (7931), 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-11-02 12:37:59,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 7931 transitions. [2024-11-02 12:37:59,474 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 7931 transitions. Word has length 21 [2024-11-02 12:37:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:37:59,474 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 7931 transitions. [2024-11-02 12:37:59,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-11-02 12:37:59,475 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 7931 transitions. [2024-11-02 12:37:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-02 12:37:59,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:37:59,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:37:59,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 12:37:59,482 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:37:59,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:37:59,483 INFO L85 PathProgramCache]: Analyzing trace with hash -664291030, now seen corresponding path program 1 times [2024-11-02 12:37:59,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:37:59,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542094948] [2024-11-02 12:37:59,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:37:59,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:37:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:38:00,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:38:00,312 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:38:00,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542094948] [2024-11-02 12:38:00,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542094948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:38:00,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:38:00,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:38:00,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008577356] [2024-11-02 12:38:00,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:38:00,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:38:00,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:38:00,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:38:00,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:38:00,315 INFO L87 Difference]: Start difference. First operand 2478 states and 7931 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:38:00,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:38:00,606 INFO L93 Difference]: Finished difference Result 2966 states and 9287 transitions. [2024-11-02 12:38:00,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:38:00,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-02 12:38:00,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:38:00,622 INFO L225 Difference]: With dead ends: 2966 [2024-11-02 12:38:00,622 INFO L226 Difference]: Without dead ends: 1512 [2024-11-02 12:38:00,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:38:00,629 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 100 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:38:00,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 35 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:38:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1512 states. [2024-11-02 12:38:00,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1512 to 1512. [2024-11-02 12:38:00,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1512 states, 1511 states have (on average 3.0112508272667107) internal successors, (4550), 1511 states have internal predecessors, (4550), 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-11-02 12:38:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1512 states to 1512 states and 4550 transitions. [2024-11-02 12:38:00,679 INFO L78 Accepts]: Start accepts. Automaton has 1512 states and 4550 transitions. Word has length 24 [2024-11-02 12:38:00,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:38:00,680 INFO L471 AbstractCegarLoop]: Abstraction has 1512 states and 4550 transitions. [2024-11-02 12:38:00,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:38:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1512 states and 4550 transitions. [2024-11-02 12:38:00,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-02 12:38:00,684 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:38:00,684 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:38:00,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 12:38:00,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:38:00,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:38:00,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1315215763, now seen corresponding path program 1 times [2024-11-02 12:38:00,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:38:00,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893431636] [2024-11-02 12:38:00,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:38:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:38:01,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:38:01,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:38:01,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:38:01,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893431636] [2024-11-02 12:38:01,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893431636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:38:01,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:38:01,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:38:01,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936785010] [2024-11-02 12:38:01,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:38:01,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:38:01,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:38:01,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:38:01,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:38:01,732 INFO L87 Difference]: Start difference. First operand 1512 states and 4550 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-11-02 12:38:02,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:38:02,002 INFO L93 Difference]: Finished difference Result 1576 states and 4702 transitions. [2024-11-02 12:38:02,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:38:02,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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) Word has length 27 [2024-11-02 12:38:02,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:38:02,014 INFO L225 Difference]: With dead ends: 1576 [2024-11-02 12:38:02,014 INFO L226 Difference]: Without dead ends: 1088 [2024-11-02 12:38:02,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:38:02,016 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 126 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:38:02,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 26 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:38:02,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-11-02 12:38:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1088. [2024-11-02 12:38:02,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 3.015639374425023) internal successors, (3278), 1087 states have internal predecessors, (3278), 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-11-02 12:38:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 3278 transitions. [2024-11-02 12:38:02,055 INFO L78 Accepts]: Start accepts. Automaton has 1088 states and 3278 transitions. Word has length 27 [2024-11-02 12:38:02,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:38:02,055 INFO L471 AbstractCegarLoop]: Abstraction has 1088 states and 3278 transitions. [2024-11-02 12:38:02,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 5 states have internal predecessors, (27), 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-11-02 12:38:02,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1088 states and 3278 transitions. [2024-11-02 12:38:02,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-02 12:38:02,059 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:38:02,060 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:38:02,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 12:38:02,060 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:38:02,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:38:02,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1927198495, now seen corresponding path program 1 times [2024-11-02 12:38:02,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:38:02,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228537895] [2024-11-02 12:38:02,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:38:02,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:38:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:38:02,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:38:02,864 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:38:02,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228537895] [2024-11-02 12:38:02,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228537895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:38:02,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:38:02,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 12:38:02,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724735791] [2024-11-02 12:38:02,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:38:02,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:38:02,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:38:02,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:38:02,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:38:02,867 INFO L87 Difference]: Start difference. First operand 1088 states and 3278 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:38:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:38:03,257 INFO L93 Difference]: Finished difference Result 1472 states and 4374 transitions. [2024-11-02 12:38:03,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:38:03,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-02 12:38:03,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:38:03,271 INFO L225 Difference]: With dead ends: 1472 [2024-11-02 12:38:03,271 INFO L226 Difference]: Without dead ends: 678 [2024-11-02 12:38:03,273 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:38:03,276 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 45 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:38:03,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 80 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 12:38:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2024-11-02 12:38:03,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 678. [2024-11-02 12:38:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 2.877400295420975) internal successors, (1948), 677 states have internal predecessors, (1948), 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-11-02 12:38:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1948 transitions. [2024-11-02 12:38:03,304 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1948 transitions. Word has length 32 [2024-11-02 12:38:03,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:38:03,305 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 1948 transitions. [2024-11-02 12:38:03,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:38:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1948 transitions. [2024-11-02 12:38:03,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-02 12:38:03,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:38:03,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:38:03,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 12:38:03,310 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:38:03,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:38:03,314 INFO L85 PathProgramCache]: Analyzing trace with hash -221635587, now seen corresponding path program 2 times [2024-11-02 12:38:03,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:38:03,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571104716] [2024-11-02 12:38:03,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:38:03,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:38:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:38:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:38:07,108 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:38:07,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571104716] [2024-11-02 12:38:07,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571104716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:38:07,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:38:07,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-02 12:38:07,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746820943] [2024-11-02 12:38:07,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:38:07,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-02 12:38:07,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:38:07,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-02 12:38:07,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-02 12:38:07,110 INFO L87 Difference]: Start difference. First operand 678 states and 1948 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:38:07,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:38:07,802 INFO L93 Difference]: Finished difference Result 902 states and 2556 transitions. [2024-11-02 12:38:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-02 12:38:07,803 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-02 12:38:07,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:38:07,813 INFO L225 Difference]: With dead ends: 902 [2024-11-02 12:38:07,814 INFO L226 Difference]: Without dead ends: 610 [2024-11-02 12:38:07,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-02 12:38:07,816 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 93 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-02 12:38:07,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 86 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-02 12:38:07,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-02 12:38:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 546. [2024-11-02 12:38:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 545 states have (on average 2.8256880733944953) internal successors, (1540), 545 states have internal predecessors, (1540), 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-11-02 12:38:07,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1540 transitions. [2024-11-02 12:38:07,845 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1540 transitions. Word has length 32 [2024-11-02 12:38:07,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:38:07,846 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 1540 transitions. [2024-11-02 12:38:07,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:38:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1540 transitions. [2024-11-02 12:38:07,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-02 12:38:07,848 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:38:07,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:38:07,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 12:38:07,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2024-11-02 12:38:07,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:38:07,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1127657375, now seen corresponding path program 3 times [2024-11-02 12:38:07,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:38:07,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453715399] [2024-11-02 12:38:07,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:38:07,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:38:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:38:08,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 12:38:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:38:08,684 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-02 12:38:08,684 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 12:38:08,686 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (8 of 9 remaining) [2024-11-02 12:38:08,687 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (7 of 9 remaining) [2024-11-02 12:38:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (6 of 9 remaining) [2024-11-02 12:38:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (5 of 9 remaining) [2024-11-02 12:38:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2024-11-02 12:38:08,688 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2024-11-02 12:38:08,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2024-11-02 12:38:08,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (1 of 9 remaining) [2024-11-02 12:38:08,692 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2024-11-02 12:38:08,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 12:38:08,696 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:38:08,822 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-02 12:38:08,822 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 12:38:08,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:38:08 BasicIcfg [2024-11-02 12:38:08,829 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 12:38:08,830 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 12:38:08,832 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 12:38:08,832 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 12:38:08,833 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:37:50" (3/4) ... [2024-11-02 12:38:08,835 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-02 12:38:08,837 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 12:38:08,838 INFO L158 Benchmark]: Toolchain (without parser) took 21596.94ms. Allocated memory was 125.8MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 85.3MB in the beginning and 807.7MB in the end (delta: -722.5MB). Peak memory consumption was 569.6MB. Max. memory is 16.1GB. [2024-11-02 12:38:08,838 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 12:38:08,839 INFO L158 Benchmark]: CACSL2BoogieTranslator took 952.76ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 53.8MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-02 12:38:08,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.08ms. Allocated memory is still 125.8MB. Free memory was 53.8MB in the beginning and 49.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-02 12:38:08,839 INFO L158 Benchmark]: Boogie Preprocessor took 95.20ms. Allocated memory is still 125.8MB. Free memory was 49.2MB in the beginning and 91.5MB in the end (delta: -42.3MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2024-11-02 12:38:08,840 INFO L158 Benchmark]: RCFGBuilder took 1615.01ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 91.5MB in the beginning and 78.0MB in the end (delta: 13.5MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. [2024-11-02 12:38:08,841 INFO L158 Benchmark]: TraceAbstraction took 18809.11ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 77.1MB in the beginning and 807.7MB in the end (delta: -730.7MB). Peak memory consumption was 517.9MB. Max. memory is 16.1GB. [2024-11-02 12:38:08,841 INFO L158 Benchmark]: Witness Printer took 7.56ms. Allocated memory is still 1.4GB. Free memory is still 807.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 12:38:08,843 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.32ms. Allocated memory is still 125.8MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 952.76ms. Allocated memory is still 125.8MB. Free memory was 84.8MB in the beginning and 53.8MB in the end (delta: 31.1MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.08ms. Allocated memory is still 125.8MB. Free memory was 53.8MB in the beginning and 49.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.20ms. Allocated memory is still 125.8MB. Free memory was 49.2MB in the beginning and 91.5MB in the end (delta: -42.3MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1615.01ms. Allocated memory was 125.8MB in the beginning and 167.8MB in the end (delta: 41.9MB). Free memory was 91.5MB in the beginning and 78.0MB in the end (delta: 13.5MB). Peak memory consumption was 59.3MB. Max. memory is 16.1GB. * TraceAbstraction took 18809.11ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 77.1MB in the beginning and 807.7MB in the end (delta: -730.7MB). Peak memory consumption was 517.9MB. Max. memory is 16.1GB. * Witness Printer took 7.56ms. Allocated memory is still 1.4GB. Free memory is still 807.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff0_thd3; [L728] 0 _Bool x$r_buff1_thd0; [L729] 0 _Bool x$r_buff1_thd1; [L730] 0 _Bool x$r_buff1_thd2; [L731] 0 _Bool x$r_buff1_thd3; [L732] 0 _Bool x$read_delayed; [L733] 0 int *x$read_delayed_var; [L734] 0 int x$w_buff0; [L735] 0 _Bool x$w_buff0_used; [L736] 0 int x$w_buff1; [L737] 0 _Bool x$w_buff1_used; [L739] 0 int y = 0; [L740] 0 _Bool y$flush_delayed; [L741] 0 int y$mem_tmp; [L742] 0 _Bool y$r_buff0_thd0; [L743] 0 _Bool y$r_buff0_thd1; [L744] 0 _Bool y$r_buff0_thd2; [L745] 0 _Bool y$r_buff0_thd3; [L746] 0 _Bool y$r_buff1_thd0; [L747] 0 _Bool y$r_buff1_thd1; [L748] 0 _Bool y$r_buff1_thd2; [L749] 0 _Bool y$r_buff1_thd3; [L750] 0 _Bool y$read_delayed; [L751] 0 int *y$read_delayed_var; [L752] 0 int y$w_buff0; [L753] 0 _Bool y$w_buff0_used; [L754] 0 int y$w_buff1; [L755] 0 _Bool y$w_buff1_used; [L757] 0 int z = 0; [L758] 0 _Bool weak$$choice0; [L759] 0 _Bool weak$$choice2; [L899] 0 pthread_t t171; [L900] FCALL, FORK 0 pthread_create(&t171, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t171=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L901] 0 pthread_t t172; [L902] FCALL, FORK 0 pthread_create(&t172, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171=-1, t172=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 2 x$w_buff1 = x$w_buff0 [L784] 2 x$w_buff0 = 2 [L785] 2 x$w_buff1_used = x$w_buff0_used [L786] 2 x$w_buff0_used = (_Bool)1 [L787] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L787] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L788] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L789] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L790] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L791] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L792] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L795] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 2 x$flush_delayed = weak$$choice2 [L798] 2 x$mem_tmp = x [L799] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L800] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L801] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L802] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L803] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L804] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L805] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L806] 2 __unbuffered_p1_EAX = x [L807] 2 x = x$flush_delayed ? x$mem_tmp : x [L808] 2 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L811] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 2 y$flush_delayed = weak$$choice2 [L814] 2 y$mem_tmp = y [L815] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L816] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L817] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L818] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L819] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L820] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L821] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L822] 2 __unbuffered_p1_EBX = y [L823] 2 y = y$flush_delayed ? y$mem_tmp : y [L824] 2 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L903] 0 pthread_t t173; [L904] FCALL, FORK 0 pthread_create(&t173, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t171=-1, t172=0, t173=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L841] 3 y$w_buff1 = y$w_buff0 [L842] 3 y$w_buff0 = 1 [L843] 3 y$w_buff1_used = y$w_buff0_used [L844] 3 y$w_buff0_used = (_Bool)1 [L845] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L845] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L846] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L847] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L848] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L849] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L850] 3 y$r_buff0_thd3 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L853] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L854] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L855] 3 y$flush_delayed = weak$$choice2 [L856] 3 y$mem_tmp = y [L857] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L858] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L859] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L860] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L861] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L862] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L863] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L864] 3 __unbuffered_p2_EAX = y [L865] 3 y = y$flush_delayed ? y$mem_tmp : y [L866] 3 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L869] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L763] 1 z = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L766] 1 x = 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L872] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L873] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L874] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L875] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L876] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L877] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L878] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L879] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L880] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L881] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L884] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L827] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L828] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L829] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L830] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L831] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L834] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L906] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171=-1, t172=0, t173=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L908] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L908] RET 0 assume_abort_if_not(main$tmp_guard0) [L910] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L911] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L912] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L913] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L914] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L915] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L916] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L917] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L918] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L919] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171=-1, t172=0, t173=1, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L922] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L923] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L924] 0 x$flush_delayed = weak$$choice2 [L925] 0 x$mem_tmp = x [L926] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L927] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L928] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L929] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L930] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L931] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L932] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L933] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L934] 0 x = x$flush_delayed ? x$mem_tmp : x [L935] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t171=-1, t172=0, t173=1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L937] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] [L17] 0 __assert_fail ("0", "mix006_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 897]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 900]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 902]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 904]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 74 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 18.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.2s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 667 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 509 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 351 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1110 IncrementalHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 158 mSDtfsCounter, 1110 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8395occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 10 MinimizatonAttempts, 64 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 8.8s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-02 12:38:08,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:38:11,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:38:11,940 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-02 12:38:11,947 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:38:11,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:38:11,985 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:38:11,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:38:11,986 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:38:11,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:38:11,988 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:38:11,989 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:38:11,990 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:38:11,990 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:38:11,990 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:38:11,994 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:38:11,994 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:38:11,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 12:38:11,995 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 12:38:11,995 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:38:11,996 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 12:38:11,996 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:38:11,997 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 12:38:11,997 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:38:11,998 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 12:38:11,999 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 12:38:11,999 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 12:38:11,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:38:12,000 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 12:38:12,000 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 12:38:12,000 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:38:12,000 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 12:38:12,001 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 12:38:12,001 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 12:38:12,002 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:38:12,002 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:38:12,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 12:38:12,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:38:12,003 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:38:12,003 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:38:12,003 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:38:12,004 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:38:12,005 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-02 12:38:12,005 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 12:38:12,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:38:12,006 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:38:12,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:38:12,006 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> a555daf8b3d43d9709cd95be6561d3a47f75ee906fd0e296710c365eb1f220a2 [2024-11-02 12:38:12,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:38:12,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:38:12,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:38:12,438 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:38:12,438 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:38:12,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d3e8cc5e-9d14-4bf1-86c4-ceb1348d6bda/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/pthread-wmm/mix006_tso.oepc.i