./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:01:46,267 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:01:46,388 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-06 21:01:46,396 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:01:46,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:01:46,436 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:01:46,437 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:01:46,438 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:01:46,439 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:01:46,444 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:01:46,445 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 21:01:46,446 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 21:01:46,446 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 21:01:46,448 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 21:01:46,449 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 21:01:46,449 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 21:01:46,450 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 21:01:46,450 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 21:01:46,451 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 21:01:46,451 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 21:01:46,452 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 21:01:46,452 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 21:01:46,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:01:46,454 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:01:46,454 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:01:46,455 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:01:46,455 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:01:46,456 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:01:46,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:01:46,457 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:01:46,458 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:01:46,458 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:01:46,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:01:46,459 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:01:46,459 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:01:46,459 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:01:46,460 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:01:46,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:01:46,460 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:01:46,461 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:01:46,461 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:01:46,461 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:01:46,462 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 21:01:46,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:01:46,463 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 21:01:46,463 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:01:46,463 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_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/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_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2023-11-06 21:01:46,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:01:46,737 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:01:46,740 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:01:46,741 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:01:46,743 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:01:46,745 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-11-06 21:01:49,812 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:01:50,181 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:01:50,182 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-11-06 21:01:50,200 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/data/bc55c7aca/e0ee276080454c5a9ab5a7f686874a79/FLAGc55b1d103 [2023-11-06 21:01:50,216 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/data/bc55c7aca/e0ee276080454c5a9ab5a7f686874a79 [2023-11-06 21:01:50,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:01:50,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:01:50,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:01:50,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:01:50,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:01:50,233 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:50,235 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4090e723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50, skipping insertion in model container [2023-11-06 21:01:50,235 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:50,315 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:01:50,709 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:01:50,728 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:01:50,838 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:01:50,891 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:01:50,891 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:01:50,899 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:01:50,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50 WrapperNode [2023-11-06 21:01:50,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:01:50,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:01:50,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:01:50,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:01:50,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:50,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,049 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2023-11-06 21:01:51,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:01:51,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:01:51,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:01:51,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:01:51,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,078 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,078 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,145 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,151 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:01:51,152 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:01:51,152 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:01:51,153 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:01:51,153 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (1/1) ... [2023-11-06 21:01:51,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:01:51,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 21:01:51,193 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:01:51,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:01:51,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:01:51,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:01:51,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:01:51,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:01:51,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:01:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 21:01:51,246 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 21:01:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 21:01:51,247 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 21:01:51,247 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 21:01:51,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 21:01:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 21:01:51,248 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 21:01:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:01:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:01:51,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:01:51,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:01:51,251 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:01:51,435 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:01:51,437 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:01:51,891 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:01:52,139 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:01:52,140 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 21:01:52,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:52 BoogieIcfgContainer [2023-11-06 21:01:52,143 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:01:52,146 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:01:52,146 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:01:52,150 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:01:52,150 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:01:50" (1/3) ... [2023-11-06 21:01:52,151 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7efaa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:52, skipping insertion in model container [2023-11-06 21:01:52,151 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:01:50" (2/3) ... [2023-11-06 21:01:52,152 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7efaa7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:01:52, skipping insertion in model container [2023-11-06 21:01:52,152 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:52" (3/3) ... [2023-11-06 21:01:52,153 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2023-11-06 21:01:52,180 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:01:52,180 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 21:01:52,180 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:01:52,292 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 21:01:52,350 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-06 21:01:52,364 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 159 places, 149 transitions, 314 flow [2023-11-06 21:01:52,367 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 159 places, 149 transitions, 314 flow [2023-11-06 21:01:52,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 149 transitions, 314 flow [2023-11-06 21:01:52,488 INFO L124 PetriNetUnfolderBase]: 3/145 cut-off events. [2023-11-06 21:01:52,489 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:01:52,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 145 events. 3/145 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 110 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 103. Up to 2 conditions per place. [2023-11-06 21:01:52,507 INFO L119 LiptonReduction]: Number of co-enabled transitions 3510 [2023-11-06 21:01:59,579 INFO L134 LiptonReduction]: Checked pairs total: 9215 [2023-11-06 21:01:59,580 INFO L136 LiptonReduction]: Total number of compositions: 145 [2023-11-06 21:01:59,588 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 42 transitions, 100 flow [2023-11-06 21:01:59,838 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3156 states, 3143 states have (on average 3.9910913140311806) internal successors, (12544), 3155 states have internal predecessors, (12544), 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) [2023-11-06 21:01:59,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:01:59,869 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@39f878d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 21:01:59,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 21:01:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 3156 states, 3143 states have (on average 3.9910913140311806) internal successors, (12544), 3155 states have internal predecessors, (12544), 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) [2023-11-06 21:01:59,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-06 21:01:59,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:01:59,892 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-06 21:01:59,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:01:59,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:01:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash 657, now seen corresponding path program 1 times [2023-11-06 21:01:59,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:01:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584332268] [2023-11-06 21:01:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:01:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:00,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:00,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:00,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584332268] [2023-11-06 21:02:00,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584332268] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:00,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:00,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:02:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717131420] [2023-11-06 21:02:00,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:00,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:02:00,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:02:00,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:02:00,076 INFO L87 Difference]: Start difference. First operand has 3156 states, 3143 states have (on average 3.9910913140311806) internal successors, (12544), 3155 states have internal predecessors, (12544), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2023-11-06 21:02:00,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:00,233 INFO L93 Difference]: Finished difference Result 2986 states and 11584 transitions. [2023-11-06 21:02:00,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:02:00,235 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2023-11-06 21:02:00,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:00,284 INFO L225 Difference]: With dead ends: 2986 [2023-11-06 21:02:00,284 INFO L226 Difference]: Without dead ends: 2986 [2023-11-06 21:02:00,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:02:00,289 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:00,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:02:00,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2023-11-06 21:02:00,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2986. [2023-11-06 21:02:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2981 states have (on average 3.8859443139885945) internal successors, (11584), 2985 states have internal predecessors, (11584), 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) [2023-11-06 21:02:00,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 11584 transitions. [2023-11-06 21:02:00,489 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 11584 transitions. Word has length 1 [2023-11-06 21:02:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:00,490 INFO L495 AbstractCegarLoop]: Abstraction has 2986 states and 11584 transitions. [2023-11-06 21:02:00,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2023-11-06 21:02:00,490 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 11584 transitions. [2023-11-06 21:02:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 21:02:00,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:00,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:02:00,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:02:00,493 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:00,493 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash 2118364457, now seen corresponding path program 1 times [2023-11-06 21:02:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:00,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262482421] [2023-11-06 21:02:00,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:00,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:00,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:00,942 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:00,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262482421] [2023-11-06 21:02:00,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262482421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:00,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:00,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:02:00,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676394775] [2023-11-06 21:02:00,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:00,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:02:00,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:00,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:02:00,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:02:00,946 INFO L87 Difference]: Start difference. First operand 2986 states and 11584 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:01,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:01,068 INFO L93 Difference]: Finished difference Result 2538 states and 9744 transitions. [2023-11-06 21:02:01,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:02:01,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-06 21:02:01,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:01,100 INFO L225 Difference]: With dead ends: 2538 [2023-11-06 21:02:01,101 INFO L226 Difference]: Without dead ends: 2474 [2023-11-06 21:02:01,101 INFO L412 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 [2023-11-06 21:02:01,159 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:01,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:02:01,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2023-11-06 21:02:01,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2474. [2023-11-06 21:02:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2474 states, 2472 states have (on average 3.8576051779935274) internal successors, (9536), 2473 states have internal predecessors, (9536), 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) [2023-11-06 21:02:01,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 9536 transitions. [2023-11-06 21:02:01,332 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 9536 transitions. Word has length 9 [2023-11-06 21:02:01,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:01,335 INFO L495 AbstractCegarLoop]: Abstraction has 2474 states and 9536 transitions. [2023-11-06 21:02:01,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:01,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 9536 transitions. [2023-11-06 21:02:01,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 21:02:01,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:01,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:02:01,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:02:01,342 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:01,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:01,346 INFO L85 PathProgramCache]: Analyzing trace with hash -66229744, now seen corresponding path program 1 times [2023-11-06 21:02:01,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:01,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700498204] [2023-11-06 21:02:01,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:01,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:01,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700498204] [2023-11-06 21:02:01,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700498204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:01,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:01,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 21:02:01,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198687584] [2023-11-06 21:02:01,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:01,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:02:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:01,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:02:01,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:02:01,553 INFO L87 Difference]: Start difference. First operand 2474 states and 9536 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:01,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:01,653 INFO L93 Difference]: Finished difference Result 2346 states and 8992 transitions. [2023-11-06 21:02:01,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:02:01,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-06 21:02:01,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:01,680 INFO L225 Difference]: With dead ends: 2346 [2023-11-06 21:02:01,680 INFO L226 Difference]: Without dead ends: 2346 [2023-11-06 21:02:01,680 INFO L412 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 [2023-11-06 21:02:01,682 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:01,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:02:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2023-11-06 21:02:01,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2346. [2023-11-06 21:02:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2346 states, 2344 states have (on average 3.83617747440273) internal successors, (8992), 2345 states have internal predecessors, (8992), 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) [2023-11-06 21:02:01,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8992 transitions. [2023-11-06 21:02:01,823 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8992 transitions. Word has length 11 [2023-11-06 21:02:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:01,823 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 8992 transitions. [2023-11-06 21:02:01,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:01,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8992 transitions. [2023-11-06 21:02:01,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 21:02:01,827 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:01,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:02:01,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:02:01,828 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:01,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:01,828 INFO L85 PathProgramCache]: Analyzing trace with hash -2053121410, now seen corresponding path program 1 times [2023-11-06 21:02:01,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:01,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919390810] [2023-11-06 21:02:01,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:01,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:02,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:02,723 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:02,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919390810] [2023-11-06 21:02:02,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919390810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:02,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:02:02,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129523903] [2023-11-06 21:02:02,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:02,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:02:02,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:02,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:02:02,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:02:02,727 INFO L87 Difference]: Start difference. First operand 2346 states and 8992 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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) [2023-11-06 21:02:03,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:03,134 INFO L93 Difference]: Finished difference Result 2474 states and 9216 transitions. [2023-11-06 21:02:03,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:02:03,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2023-11-06 21:02:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:03,159 INFO L225 Difference]: With dead ends: 2474 [2023-11-06 21:02:03,159 INFO L226 Difference]: Without dead ends: 2090 [2023-11-06 21:02:03,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:02:03,162 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:03,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 56 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:02:03,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2023-11-06 21:02:03,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2023-11-06 21:02:03,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2090 states, 2088 states have (on average 3.78544061302682) internal successors, (7904), 2089 states have internal predecessors, (7904), 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) [2023-11-06 21:02:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7904 transitions. [2023-11-06 21:02:03,265 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7904 transitions. Word has length 12 [2023-11-06 21:02:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:03,266 INFO L495 AbstractCegarLoop]: Abstraction has 2090 states and 7904 transitions. [2023-11-06 21:02:03,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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) [2023-11-06 21:02:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7904 transitions. [2023-11-06 21:02:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 21:02:03,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:03,271 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:02:03,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:02:03,273 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:03,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:03,273 INFO L85 PathProgramCache]: Analyzing trace with hash 777670518, now seen corresponding path program 1 times [2023-11-06 21:02:03,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:03,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309331174] [2023-11-06 21:02:03,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:03,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:03,610 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309331174] [2023-11-06 21:02:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309331174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:03,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:03,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:02:03,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773483511] [2023-11-06 21:02:03,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:03,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:02:03,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:03,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:02:03,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:02:03,613 INFO L87 Difference]: Start difference. First operand 2090 states and 7904 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:03,764 INFO L93 Difference]: Finished difference Result 1961 states and 6658 transitions. [2023-11-06 21:02:03,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:02:03,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-06 21:02:03,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:03,781 INFO L225 Difference]: With dead ends: 1961 [2023-11-06 21:02:03,781 INFO L226 Difference]: Without dead ends: 1577 [2023-11-06 21:02:03,781 INFO L412 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 [2023-11-06 21:02:03,782 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 52 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:03,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 9 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:02:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2023-11-06 21:02:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1577. [2023-11-06 21:02:03,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1575 states have (on average 3.38984126984127) internal successors, (5339), 1576 states have internal predecessors, (5339), 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) [2023-11-06 21:02:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 5339 transitions. [2023-11-06 21:02:03,850 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 5339 transitions. Word has length 13 [2023-11-06 21:02:03,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:03,850 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 5339 transitions. [2023-11-06 21:02:03,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 5339 transitions. [2023-11-06 21:02:03,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 21:02:03,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:03,854 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:02:03,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:02:03,854 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:03,854 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:03,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1354129295, now seen corresponding path program 1 times [2023-11-06 21:02:03,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:03,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248552070] [2023-11-06 21:02:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:03,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:03,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:04,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:04,161 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:04,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248552070] [2023-11-06 21:02:04,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248552070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:04,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:04,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:02:04,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578087557] [2023-11-06 21:02:04,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:04,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:02:04,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:04,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:02:04,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:02:04,163 INFO L87 Difference]: Start difference. First operand 1577 states and 5339 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-11-06 21:02:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:04,347 INFO L93 Difference]: Finished difference Result 1178 states and 3553 transitions. [2023-11-06 21:02:04,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:02:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2023-11-06 21:02:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:04,365 INFO L225 Difference]: With dead ends: 1178 [2023-11-06 21:02:04,366 INFO L226 Difference]: Without dead ends: 929 [2023-11-06 21:02:04,366 INFO L412 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 [2023-11-06 21:02:04,367 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 92 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:04,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 12 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:02:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2023-11-06 21:02:04,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 929. [2023-11-06 21:02:04,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 929 states, 927 states have (on average 2.9633225458468178) internal successors, (2747), 928 states have internal predecessors, (2747), 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) [2023-11-06 21:02:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 929 states to 929 states and 2747 transitions. [2023-11-06 21:02:04,421 INFO L78 Accepts]: Start accepts. Automaton has 929 states and 2747 transitions. Word has length 16 [2023-11-06 21:02:04,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:04,422 INFO L495 AbstractCegarLoop]: Abstraction has 929 states and 2747 transitions. [2023-11-06 21:02:04,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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) [2023-11-06 21:02:04,422 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 2747 transitions. [2023-11-06 21:02:04,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 21:02:04,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:04,426 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:02:04,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:02:04,426 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:04,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:04,427 INFO L85 PathProgramCache]: Analyzing trace with hash 2027550690, now seen corresponding path program 1 times [2023-11-06 21:02:04,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:04,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619948267] [2023-11-06 21:02:04,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:04,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:04,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:04,769 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:04,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619948267] [2023-11-06 21:02:04,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619948267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:04,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:04,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:02:04,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240793334] [2023-11-06 21:02:04,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:04,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:02:04,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:04,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:02:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:02:04,772 INFO L87 Difference]: Start difference. First operand 929 states and 2747 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:05,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:05,007 INFO L93 Difference]: Finished difference Result 710 states and 2059 transitions. [2023-11-06 21:02:05,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:02:05,008 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-06 21:02:05,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:05,013 INFO L225 Difference]: With dead ends: 710 [2023-11-06 21:02:05,013 INFO L226 Difference]: Without dead ends: 623 [2023-11-06 21:02:05,013 INFO L412 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 [2023-11-06 21:02:05,014 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 120 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:05,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 15 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:02:05,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-11-06 21:02:05,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2023-11-06 21:02:05,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 621 states have (on average 2.9452495974235107) internal successors, (1829), 622 states have internal predecessors, (1829), 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) [2023-11-06 21:02:05,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 1829 transitions. [2023-11-06 21:02:05,043 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 1829 transitions. Word has length 19 [2023-11-06 21:02:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:05,044 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 1829 transitions. [2023-11-06 21:02:05,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 1829 transitions. [2023-11-06 21:02:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 21:02:05,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:05,048 INFO L195 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] [2023-11-06 21:02:05,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:02:05,048 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:05,049 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:05,049 INFO L85 PathProgramCache]: Analyzing trace with hash -713147779, now seen corresponding path program 1 times [2023-11-06 21:02:05,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:05,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147246265] [2023-11-06 21:02:05,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:05,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:05,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:05,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:05,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147246265] [2023-11-06 21:02:05,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147246265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:05,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:05,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:02:05,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065222794] [2023-11-06 21:02:05,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:05,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:02:05,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:05,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:02:05,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:02:05,377 INFO L87 Difference]: Start difference. First operand 623 states and 1829 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:05,543 INFO L93 Difference]: Finished difference Result 800 states and 2302 transitions. [2023-11-06 21:02:05,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:02:05,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 21:02:05,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:05,547 INFO L225 Difference]: With dead ends: 800 [2023-11-06 21:02:05,547 INFO L226 Difference]: Without dead ends: 800 [2023-11-06 21:02:05,547 INFO L412 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 [2023-11-06 21:02:05,548 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:05,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 5 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:02:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2023-11-06 21:02:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 729. [2023-11-06 21:02:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 727 states have (on average 2.8803301237964236) internal successors, (2094), 728 states have internal predecessors, (2094), 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) [2023-11-06 21:02:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 2094 transitions. [2023-11-06 21:02:05,576 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 2094 transitions. Word has length 22 [2023-11-06 21:02:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:05,577 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 2094 transitions. [2023-11-06 21:02:05,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:05,578 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 2094 transitions. [2023-11-06 21:02:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 21:02:05,580 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:05,580 INFO L195 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] [2023-11-06 21:02:05,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:02:05,582 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:05,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:05,583 INFO L85 PathProgramCache]: Analyzing trace with hash 595405019, now seen corresponding path program 1 times [2023-11-06 21:02:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:05,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395930622] [2023-11-06 21:02:05,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:05,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:05,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:05,899 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:05,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395930622] [2023-11-06 21:02:05,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395930622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:05,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:05,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:02:05,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455631131] [2023-11-06 21:02:05,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:05,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:02:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:05,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:02:05,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:02:05,902 INFO L87 Difference]: Start difference. First operand 729 states and 2094 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:06,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:06,099 INFO L93 Difference]: Finished difference Result 671 states and 1964 transitions. [2023-11-06 21:02:06,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:02:06,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-06 21:02:06,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:06,103 INFO L225 Difference]: With dead ends: 671 [2023-11-06 21:02:06,103 INFO L226 Difference]: Without dead ends: 645 [2023-11-06 21:02:06,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-11-06 21:02:06,104 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 126 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:06,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 12 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:02:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2023-11-06 21:02:06,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 585. [2023-11-06 21:02:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 583 states have (on average 3.012006861063465) internal successors, (1756), 584 states have internal predecessors, (1756), 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) [2023-11-06 21:02:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1756 transitions. [2023-11-06 21:02:06,128 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1756 transitions. Word has length 22 [2023-11-06 21:02:06,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:06,132 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 1756 transitions. [2023-11-06 21:02:06,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1756 transitions. [2023-11-06 21:02:06,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 21:02:06,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:06,135 INFO L195 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] [2023-11-06 21:02:06,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:02:06,135 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:06,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:06,136 INFO L85 PathProgramCache]: Analyzing trace with hash -224388000, now seen corresponding path program 1 times [2023-11-06 21:02:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:06,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467434422] [2023-11-06 21:02:06,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:06,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:06,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:06,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:06,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467434422] [2023-11-06 21:02:06,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467434422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:06,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:06,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:02:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040754379] [2023-11-06 21:02:06,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:06,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:02:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:06,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:02:06,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:02:06,444 INFO L87 Difference]: Start difference. First operand 585 states and 1756 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:06,651 INFO L93 Difference]: Finished difference Result 733 states and 2168 transitions. [2023-11-06 21:02:06,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:02:06,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-06 21:02:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:06,655 INFO L225 Difference]: With dead ends: 733 [2023-11-06 21:02:06,655 INFO L226 Difference]: Without dead ends: 733 [2023-11-06 21:02:06,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:02:06,656 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 43 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:06,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 10 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:02:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2023-11-06 21:02:06,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 705. [2023-11-06 21:02:06,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 705 states, 703 states have (on average 3.004267425320057) internal successors, (2112), 704 states have internal predecessors, (2112), 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) [2023-11-06 21:02:06,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 2112 transitions. [2023-11-06 21:02:06,688 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 2112 transitions. Word has length 25 [2023-11-06 21:02:06,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:06,689 INFO L495 AbstractCegarLoop]: Abstraction has 705 states and 2112 transitions. [2023-11-06 21:02:06,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:06,689 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 2112 transitions. [2023-11-06 21:02:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 21:02:06,692 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:06,692 INFO L195 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] [2023-11-06 21:02:06,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:02:06,693 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:06,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:06,693 INFO L85 PathProgramCache]: Analyzing trace with hash 861938266, now seen corresponding path program 2 times [2023-11-06 21:02:06,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:06,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910494331] [2023-11-06 21:02:06,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:06,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:06,983 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:06,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910494331] [2023-11-06 21:02:06,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910494331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:06,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:06,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:02:06,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431303757] [2023-11-06 21:02:06,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:06,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:02:06,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:06,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:02:06,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:02:06,985 INFO L87 Difference]: Start difference. First operand 705 states and 2112 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:07,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:07,135 INFO L93 Difference]: Finished difference Result 987 states and 2867 transitions. [2023-11-06 21:02:07,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:02:07,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-06 21:02:07,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:07,141 INFO L225 Difference]: With dead ends: 987 [2023-11-06 21:02:07,141 INFO L226 Difference]: Without dead ends: 987 [2023-11-06 21:02:07,141 INFO L412 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 [2023-11-06 21:02:07,142 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:07,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 10 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 21:02:07,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2023-11-06 21:02:07,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 669. [2023-11-06 21:02:07,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 667 states have (on average 3.0) internal successors, (2001), 668 states have internal predecessors, (2001), 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) [2023-11-06 21:02:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 2001 transitions. [2023-11-06 21:02:07,171 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 2001 transitions. Word has length 25 [2023-11-06 21:02:07,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:07,172 INFO L495 AbstractCegarLoop]: Abstraction has 669 states and 2001 transitions. [2023-11-06 21:02:07,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 2001 transitions. [2023-11-06 21:02:07,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 21:02:07,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:07,175 INFO L195 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] [2023-11-06 21:02:07,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:02:07,176 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:07,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash 366749578, now seen corresponding path program 3 times [2023-11-06 21:02:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178270235] [2023-11-06 21:02:07,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:07,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:02:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:02:08,407 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 21:02:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178270235] [2023-11-06 21:02:08,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178270235] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:02:08,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:02:08,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:02:08,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358309546] [2023-11-06 21:02:08,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:02:08,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:02:08,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 21:02:08,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:02:08,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:02:08,409 INFO L87 Difference]: Start difference. First operand 669 states and 2001 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:08,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:02:08,798 INFO L93 Difference]: Finished difference Result 775 states and 2252 transitions. [2023-11-06 21:02:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:02:08,799 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-06 21:02:08,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:02:08,803 INFO L225 Difference]: With dead ends: 775 [2023-11-06 21:02:08,803 INFO L226 Difference]: Without dead ends: 775 [2023-11-06 21:02:08,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2023-11-06 21:02:08,804 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 59 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:02:08,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 46 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:02:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2023-11-06 21:02:08,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 637. [2023-11-06 21:02:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 635 states have (on average 3.0094488188976376) internal successors, (1911), 636 states have internal predecessors, (1911), 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) [2023-11-06 21:02:08,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1911 transitions. [2023-11-06 21:02:08,838 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1911 transitions. Word has length 25 [2023-11-06 21:02:08,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:02:08,838 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 1911 transitions. [2023-11-06 21:02:08,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:02:08,839 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1911 transitions. [2023-11-06 21:02:08,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 21:02:08,845 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:02:08,845 INFO L195 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] [2023-11-06 21:02:08,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:02:08,845 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-06 21:02:08,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:02:08,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1255940214, now seen corresponding path program 4 times [2023-11-06 21:02:08,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 21:02:08,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331737996] [2023-11-06 21:02:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:02:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:02:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:02:08,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:02:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:02:09,028 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-06 21:02:09,028 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:02:09,030 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 21:02:09,031 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 21:02:09,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 21:02:09,032 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 21:02:09,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 21:02:09,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 21:02:09,033 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 21:02:09,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 21:02:09,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 21:02:09,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 21:02:09,034 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 21:02:09,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 21:02:09,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 21:02:09,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 21:02:09,035 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 21:02:09,036 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 21:02:09,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:02:09,038 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:02:09,044 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 21:02:09,044 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:02:09,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:02:09 BasicIcfg [2023-11-06 21:02:09,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:02:09,187 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:02:09,187 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:02:09,188 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:02:09,188 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:01:52" (3/4) ... [2023-11-06 21:02:09,190 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 21:02:09,191 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:02:09,192 INFO L158 Benchmark]: Toolchain (without parser) took 18971.69ms. Allocated memory was 130.0MB in the beginning and 329.3MB in the end (delta: 199.2MB). Free memory was 84.1MB in the beginning and 156.8MB in the end (delta: -72.7MB). Peak memory consumption was 126.9MB. Max. memory is 16.1GB. [2023-11-06 21:02:09,192 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 130.0MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:02:09,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.97ms. Allocated memory is still 130.0MB. Free memory was 84.1MB in the beginning and 59.5MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 21:02:09,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 148.89ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 59.5MB in the beginning and 143.5MB in the end (delta: -84.0MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2023-11-06 21:02:09,194 INFO L158 Benchmark]: Boogie Preprocessor took 100.82ms. Allocated memory is still 172.0MB. Free memory was 143.4MB in the beginning and 142.5MB in the end (delta: 910.2kB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2023-11-06 21:02:09,194 INFO L158 Benchmark]: RCFGBuilder took 990.87ms. Allocated memory is still 172.0MB. Free memory was 142.5MB in the beginning and 101.4MB in the end (delta: 41.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-06 21:02:09,195 INFO L158 Benchmark]: TraceAbstraction took 17040.67ms. Allocated memory was 172.0MB in the beginning and 329.3MB in the end (delta: 157.3MB). Free memory was 100.6MB in the beginning and 157.9MB in the end (delta: -57.3MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. [2023-11-06 21:02:09,196 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 329.3MB. Free memory was 157.9MB in the beginning and 156.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:02:09,197 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.26ms. Allocated memory is still 130.0MB. Free memory is still 71.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.97ms. Allocated memory is still 130.0MB. Free memory was 84.1MB in the beginning and 59.5MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 148.89ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 59.5MB in the beginning and 143.5MB in the end (delta: -84.0MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.82ms. Allocated memory is still 172.0MB. Free memory was 143.4MB in the beginning and 142.5MB in the end (delta: 910.2kB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * RCFGBuilder took 990.87ms. Allocated memory is still 172.0MB. Free memory was 142.5MB in the beginning and 101.4MB in the end (delta: 41.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 17040.67ms. Allocated memory was 172.0MB in the beginning and 329.3MB in the end (delta: 157.3MB). Free memory was 100.6MB in the beginning and 157.9MB in the end (delta: -57.3MB). Peak memory consumption was 99.8MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 329.3MB. Free memory was 157.9MB in the beginning and 156.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.2s, 159 PlacesBefore, 54 PlacesAfterwards, 149 TransitionsBefore, 42 TransitionsAfterwards, 3510 CoEnabledTransitionPairs, 8 FixpointIterations, 52 TrivialSequentialCompositions, 78 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 145 TotalNumberOfCompositions, 9215 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5019, independent: 4801, independent conditional: 0, independent unconditional: 4801, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2580, independent: 2524, independent conditional: 0, independent unconditional: 2524, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2580, independent: 2502, independent conditional: 0, independent unconditional: 2502, dependent: 78, dependent conditional: 0, dependent unconditional: 78, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 78, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 568, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 525, dependent conditional: 0, dependent unconditional: 525, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 5019, independent: 2277, independent conditional: 0, independent unconditional: 2277, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 2580, unknown conditional: 0, unknown unconditional: 2580] , Statistics on independence cache: Total cache size (in pairs): 274, Positive cache size: 253, Positive conditional cache size: 0, Positive unconditional cache size: 253, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-2, t445={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-1, t445={5:0}, t446={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=0, t445={5:0}, t446={6:0}, t447={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=1, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L772] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L844] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix017_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 869]: 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: 871]: 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: 867]: 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: 873]: 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 9 procedures, 182 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.1s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 616 mSDsluCounter, 190 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1233 IncrementalHoareTripleChecker+Invalid, 1269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 57 mSDtfsCounter, 1233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3156occurred in iteration=0, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 615 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 1436 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 [2023-11-06 21:02:09,244 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp --witnessprinter.witness.filename witness.graphml --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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:02:11,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:02:12,090 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-06 21:02:12,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:02:12,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:02:12,147 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:02:12,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:02:12,148 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:02:12,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:02:12,154 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:02:12,155 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 21:02:12,156 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 21:02:12,156 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 21:02:12,158 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 21:02:12,159 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 21:02:12,159 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 21:02:12,160 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:02:12,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:02:12,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:02:12,163 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:02:12,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:02:12,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:02:12,165 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:02:12,165 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 21:02:12,166 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 21:02:12,166 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 21:02:12,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:02:12,167 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:02:12,168 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:02:12,168 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:02:12,170 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:02:12,170 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:02:12,170 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:02:12,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:02:12,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:02:12,172 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:02:12,173 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:02:12,173 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:02:12,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:02:12,174 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-06 21:02:12,174 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:02:12,175 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 21:02:12,175 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:02:12,175 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_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/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_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2023-11-06 21:02:12,588 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:02:12,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:02:12,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:02:12,620 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:02:12,621 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:02:12,623 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5837ef47-9e18-4405-984d-145e58351065/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i