./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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 be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:30:43,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:30:43,527 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-06 20:30:43,533 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:30:43,533 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:30:43,566 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:30:43,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:30:43,567 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:30:43,568 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:30:43,568 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:30:43,569 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:30:43,570 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:30:43,570 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:30:43,571 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-06 20:30:43,571 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:30:43,572 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:30:43,572 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-06 20:30:43,573 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-06 20:30:43,573 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:30:43,574 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-06 20:30:43,574 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-06 20:30:43,579 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-06 20:30:43,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:30:43,581 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:30:43,586 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:30:43,587 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:30:43,587 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:30:43,587 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:30:43,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:30:43,588 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:30:43,590 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:30:43,590 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 20:30:43,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:30:43,590 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:30:43,591 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:30:43,591 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:30:43,591 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:30:43,591 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:30:43,592 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:30:43,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:30:43,592 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:30:43,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:30:43,593 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-06 20:30:43,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 20:30:43,593 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:30:43,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:30:43,594 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_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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 -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef [2023-11-06 20:30:43,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:30:43,888 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:30:43,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:30:43,892 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:30:43,894 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:30:43,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/pthread-wmm/mix037.opt.i [2023-11-06 20:30:47,008 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:30:47,356 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:30:47,357 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2023-11-06 20:30:47,384 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/data/4fc5fb573/ddc26d7a17a14872810c4438e2b1b6b4/FLAGf5391721a [2023-11-06 20:30:47,401 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/data/4fc5fb573/ddc26d7a17a14872810c4438e2b1b6b4 [2023-11-06 20:30:47,404 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:30:47,405 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:30:47,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:30:47,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:30:47,415 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:30:47,416 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:30:47" (1/1) ... [2023-11-06 20:30:47,417 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd077ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:47, skipping insertion in model container [2023-11-06 20:30:47,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:30:47" (1/1) ... [2023-11-06 20:30:47,497 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:30:47,888 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:30:47,904 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:30:47,982 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:30:48,037 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 20:30:48,038 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 20:30:48,046 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:30:48,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48 WrapperNode [2023-11-06 20:30:48,047 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:30:48,048 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:30:48,049 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:30:48,049 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:30:48,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,163 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-11-06 20:30:48,164 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:30:48,165 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:30:48,165 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:30:48,166 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:30:48,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,215 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,240 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,255 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:30:48,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:30:48,274 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:30:48,274 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:30:48,275 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (1/1) ... [2023-11-06 20:30:48,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:30:48,301 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:30:48,315 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:30:48,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:30:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 20:30:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 20:30:48,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:30:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:30:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:30:48,351 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 20:30:48,351 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 20:30:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 20:30:48,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 20:30:48,352 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 20:30:48,352 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 20:30:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 20:30:48,353 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 20:30:48,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 20:30:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 20:30:48,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:30:48,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:30:48,356 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 20:30:48,518 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:30:48,520 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:30:48,893 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:30:49,108 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:30:49,109 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 20:30:49,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:30:49 BoogieIcfgContainer [2023-11-06 20:30:49,113 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:30:49,118 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:30:49,118 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:30:49,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:30:49,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:30:47" (1/3) ... [2023-11-06 20:30:49,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d825f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:30:49, skipping insertion in model container [2023-11-06 20:30:49,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:30:48" (2/3) ... [2023-11-06 20:30:49,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14d825f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:30:49, skipping insertion in model container [2023-11-06 20:30:49,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:30:49" (3/3) ... [2023-11-06 20:30:49,132 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2023-11-06 20:30:49,153 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:30:49,153 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 20:30:49,153 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 20:30:49,256 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 20:30:49,306 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-06 20:30:49,327 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 150 transitions, 316 flow [2023-11-06 20:30:49,333 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 150 transitions, 316 flow [2023-11-06 20:30:49,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-06 20:30:49,461 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-06 20:30:49,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 20:30:49,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 20:30:49,472 INFO L119 LiptonReduction]: Number of co-enabled transitions 3632 [2023-11-06 20:30:55,799 INFO L134 LiptonReduction]: Checked pairs total: 9309 [2023-11-06 20:30:55,799 INFO L136 LiptonReduction]: Total number of compositions: 156 [2023-11-06 20:30:55,816 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 54 places, 42 transitions, 100 flow [2023-11-06 20:30:56,110 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 20:30:56,129 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 20:30:56,138 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;@314b255a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-06 20:30:56,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-06 20:30:56,155 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 20:30:56,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-06 20:30:56,162 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:56,163 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-06 20:30:56,164 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 20:30:56,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:56,174 INFO L85 PathProgramCache]: Analyzing trace with hash 639, now seen corresponding path program 1 times [2023-11-06 20:30:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:56,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368434317] [2023-11-06 20:30:56,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:56,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:56,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:56,297 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 20:30:56,298 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368434317] [2023-11-06 20:30:56,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368434317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:56,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:56,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 20:30:56,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889485805] [2023-11-06 20:30:56,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:56,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 20:30:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:56,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 20:30:56,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 20:30:56,346 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 20:30:56,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:56,482 INFO L93 Difference]: Finished difference Result 2986 states and 11584 transitions. [2023-11-06 20:30:56,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 20:30:56,485 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 20:30:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:56,538 INFO L225 Difference]: With dead ends: 2986 [2023-11-06 20:30:56,539 INFO L226 Difference]: Without dead ends: 2986 [2023-11-06 20:30:56,540 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 20:30:56,544 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 20:30:56,545 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 20:30:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2986 states. [2023-11-06 20:30:56,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2986 to 2986. [2023-11-06 20:30:56,787 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 20:30:56,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 11584 transitions. [2023-11-06 20:30:56,828 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 11584 transitions. Word has length 1 [2023-11-06 20:30:56,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:56,829 INFO L495 AbstractCegarLoop]: Abstraction has 2986 states and 11584 transitions. [2023-11-06 20:30:56,830 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 20:30:56,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 11584 transitions. [2023-11-06 20:30:56,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-06 20:30:56,834 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:56,835 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:56,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 20:30:56,841 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 20:30:56,842 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:56,842 INFO L85 PathProgramCache]: Analyzing trace with hash 536243619, now seen corresponding path program 1 times [2023-11-06 20:30:56,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:56,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465396492] [2023-11-06 20:30:56,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:56,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:57,431 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 20:30:57,431 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:57,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465396492] [2023-11-06 20:30:57,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465396492] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:57,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:57,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 20:30:57,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522644809] [2023-11-06 20:30:57,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:57,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:30:57,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:57,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:30:57,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:30:57,437 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 20:30:57,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:57,568 INFO L93 Difference]: Finished difference Result 2538 states and 9744 transitions. [2023-11-06 20:30:57,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:30:57,569 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 20:30:57,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:57,604 INFO L225 Difference]: With dead ends: 2538 [2023-11-06 20:30:57,605 INFO L226 Difference]: Without dead ends: 2474 [2023-11-06 20:30:57,606 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 20:30:57,608 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 20:30:57,608 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 20:30:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2474 states. [2023-11-06 20:30:57,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2474 to 2474. [2023-11-06 20:30:57,746 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 20:30:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 9536 transitions. [2023-11-06 20:30:57,776 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 9536 transitions. Word has length 9 [2023-11-06 20:30:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:57,777 INFO L495 AbstractCegarLoop]: Abstraction has 2474 states and 9536 transitions. [2023-11-06 20:30:57,777 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 20:30:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 9536 transitions. [2023-11-06 20:30:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-06 20:30:57,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:57,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:57,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 20:30:57,784 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 20:30:57,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:57,787 INFO L85 PathProgramCache]: Analyzing trace with hash -65886173, now seen corresponding path program 1 times [2023-11-06 20:30:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:57,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200103091] [2023-11-06 20:30:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:58,151 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 20:30:58,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:58,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200103091] [2023-11-06 20:30:58,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200103091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:58,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:58,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 20:30:58,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029633811] [2023-11-06 20:30:58,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:58,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:30:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:58,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:30:58,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:30:58,161 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 20:30:58,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:58,265 INFO L93 Difference]: Finished difference Result 2346 states and 8992 transitions. [2023-11-06 20:30:58,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:30:58,266 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 20:30:58,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:58,293 INFO L225 Difference]: With dead ends: 2346 [2023-11-06 20:30:58,293 INFO L226 Difference]: Without dead ends: 2346 [2023-11-06 20:30:58,294 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 20:30:58,297 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 20:30:58,299 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 20:30:58,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2023-11-06 20:30:58,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2346. [2023-11-06 20:30:58,436 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 20:30:58,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2346 states to 2346 states and 8992 transitions. [2023-11-06 20:30:58,455 INFO L78 Accepts]: Start accepts. Automaton has 2346 states and 8992 transitions. Word has length 11 [2023-11-06 20:30:58,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:58,456 INFO L495 AbstractCegarLoop]: Abstraction has 2346 states and 8992 transitions. [2023-11-06 20:30:58,456 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 20:30:58,456 INFO L276 IsEmpty]: Start isEmpty. Operand 2346 states and 8992 transitions. [2023-11-06 20:30:58,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-06 20:30:58,464 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:58,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:58,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 20:30:58,464 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 20:30:58,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash -2042470446, now seen corresponding path program 1 times [2023-11-06 20:30:58,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:58,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053930265] [2023-11-06 20:30:58,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:58,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:59,236 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 20:30:59,237 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:59,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053930265] [2023-11-06 20:30:59,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053930265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:59,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:59,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:30:59,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759456340] [2023-11-06 20:30:59,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:59,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:30:59,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:59,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:30:59,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:30:59,239 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 20:30:59,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:30:59,598 INFO L93 Difference]: Finished difference Result 2474 states and 9216 transitions. [2023-11-06 20:30:59,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:30:59,599 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 20:30:59,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:30:59,622 INFO L225 Difference]: With dead ends: 2474 [2023-11-06 20:30:59,622 INFO L226 Difference]: Without dead ends: 2090 [2023-11-06 20:30:59,623 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 20:30:59,624 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.3s IncrementalHoareTripleChecker+Time [2023-11-06 20:30:59,624 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.3s Time] [2023-11-06 20:30:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2023-11-06 20:30:59,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 2090. [2023-11-06 20:30:59,709 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 20:30:59,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2090 states to 2090 states and 7904 transitions. [2023-11-06 20:30:59,727 INFO L78 Accepts]: Start accepts. Automaton has 2090 states and 7904 transitions. Word has length 12 [2023-11-06 20:30:59,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:30:59,728 INFO L495 AbstractCegarLoop]: Abstraction has 2090 states and 7904 transitions. [2023-11-06 20:30:59,728 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 20:30:59,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states and 7904 transitions. [2023-11-06 20:30:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 20:30:59,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:30:59,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:30:59,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 20:30:59,731 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 20:30:59,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:30:59,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1057586328, now seen corresponding path program 1 times [2023-11-06 20:30:59,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:30:59,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881795354] [2023-11-06 20:30:59,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:30:59,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:30:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:30:59,983 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 20:30:59,984 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:30:59,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881795354] [2023-11-06 20:30:59,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881795354] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:30:59,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:30:59,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:30:59,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172483419] [2023-11-06 20:30:59,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:30:59,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:30:59,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:30:59,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:30:59,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:30:59,986 INFO L87 Difference]: Start difference. First operand 2090 states and 7904 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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 20:31:00,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:00,159 INFO L93 Difference]: Finished difference Result 3214 states and 11754 transitions. [2023-11-06 20:31:00,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:31:00,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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 20:31:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:00,206 INFO L225 Difference]: With dead ends: 3214 [2023-11-06 20:31:00,206 INFO L226 Difference]: Without dead ends: 3214 [2023-11-06 20:31:00,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:31:00,207 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 36 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:00,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2023-11-06 20:31:00,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 2442. [2023-11-06 20:31:00,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 2440 states have (on average 3.7704918032786887) internal successors, (9200), 2441 states have internal predecessors, (9200), 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 20:31:00,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 9200 transitions. [2023-11-06 20:31:00,344 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 9200 transitions. Word has length 13 [2023-11-06 20:31:00,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:00,344 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 9200 transitions. [2023-11-06 20:31:00,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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 20:31:00,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 9200 transitions. [2023-11-06 20:31:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-06 20:31:00,351 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:00,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:00,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 20:31:00,352 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 20:31:00,353 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:00,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1265583037, now seen corresponding path program 1 times [2023-11-06 20:31:00,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:00,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939558007] [2023-11-06 20:31:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:00,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:00,571 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 20:31:00,571 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:00,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939558007] [2023-11-06 20:31:00,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939558007] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:00,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:00,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:31:00,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162517894] [2023-11-06 20:31:00,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:00,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:31:00,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:00,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:31:00,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:31:00,574 INFO L87 Difference]: Start difference. First operand 2442 states and 9200 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:00,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:00,740 INFO L93 Difference]: Finished difference Result 2405 states and 8126 transitions. [2023-11-06 20:31:00,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 20:31:00,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-06 20:31:00,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:00,753 INFO L225 Difference]: With dead ends: 2405 [2023-11-06 20:31:00,754 INFO L226 Difference]: Without dead ends: 1893 [2023-11-06 20:31:00,754 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 20:31:00,755 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 37 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:00,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 15 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:00,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2023-11-06 20:31:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1893. [2023-11-06 20:31:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1893 states, 1891 states have (on average 3.399259650978318) internal successors, (6428), 1892 states have internal predecessors, (6428), 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 20:31:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 6428 transitions. [2023-11-06 20:31:00,855 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 6428 transitions. Word has length 14 [2023-11-06 20:31:00,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:00,856 INFO L495 AbstractCegarLoop]: Abstraction has 1893 states and 6428 transitions. [2023-11-06 20:31:00,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:00,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 6428 transitions. [2023-11-06 20:31:00,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-06 20:31:00,859 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:00,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:00,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 20:31:00,860 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 20:31:00,861 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1835496288, now seen corresponding path program 1 times [2023-11-06 20:31:00,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:00,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129755095] [2023-11-06 20:31:00,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:00,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:01,085 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 20:31:01,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:01,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129755095] [2023-11-06 20:31:01,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129755095] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:01,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:01,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:31:01,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143946959] [2023-11-06 20:31:01,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:01,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:31:01,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:01,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:31:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:31:01,088 INFO L87 Difference]: Start difference. First operand 1893 states and 6428 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 20:31:01,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:01,263 INFO L93 Difference]: Finished difference Result 1499 states and 4502 transitions. [2023-11-06 20:31:01,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 20:31:01,264 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 20:31:01,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:01,269 INFO L225 Difference]: With dead ends: 1499 [2023-11-06 20:31:01,269 INFO L226 Difference]: Without dead ends: 1149 [2023-11-06 20:31:01,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:31:01,270 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 59 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:01,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 21 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:01,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2023-11-06 20:31:01,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1141. [2023-11-06 20:31:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1139 states have (on average 2.9587357330992097) internal successors, (3370), 1140 states have internal predecessors, (3370), 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 20:31:01,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 3370 transitions. [2023-11-06 20:31:01,311 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 3370 transitions. Word has length 16 [2023-11-06 20:31:01,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:01,311 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 3370 transitions. [2023-11-06 20:31:01,311 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 20:31:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 3370 transitions. [2023-11-06 20:31:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-06 20:31:01,315 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:01,315 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 20:31:01,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 20:31:01,315 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 20:31:01,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 34608534, now seen corresponding path program 1 times [2023-11-06 20:31:01,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053117260] [2023-11-06 20:31:01,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:01,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:01,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:01,589 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 20:31:01,590 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:01,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053117260] [2023-11-06 20:31:01,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053117260] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:01,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:01,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 20:31:01,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182105448] [2023-11-06 20:31:01,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:01,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 20:31:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 20:31:01,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 20:31:01,593 INFO L87 Difference]: Start difference. First operand 1141 states and 3370 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 20:31:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:01,796 INFO L93 Difference]: Finished difference Result 899 states and 2554 transitions. [2023-11-06 20:31:01,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:31:01,797 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 20:31:01,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:01,800 INFO L225 Difference]: With dead ends: 899 [2023-11-06 20:31:01,800 INFO L226 Difference]: Without dead ends: 765 [2023-11-06 20:31:01,800 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:31:01,801 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:01,801 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 24 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:31:01,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-11-06 20:31:01,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 725. [2023-11-06 20:31:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 723 states have (on average 2.879668049792531) internal successors, (2082), 724 states have internal predecessors, (2082), 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 20:31:01,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 2082 transitions. [2023-11-06 20:31:01,829 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 2082 transitions. Word has length 19 [2023-11-06 20:31:01,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:01,830 INFO L495 AbstractCegarLoop]: Abstraction has 725 states and 2082 transitions. [2023-11-06 20:31:01,830 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 20:31:01,831 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 2082 transitions. [2023-11-06 20:31:01,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 20:31:01,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:01,834 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 20:31:01,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 20:31:01,834 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 20:31:01,835 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:01,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1998369148, now seen corresponding path program 1 times [2023-11-06 20:31:01,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:01,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20800551] [2023-11-06 20:31:01,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:01,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:01,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:02,428 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 20:31:02,429 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:02,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20800551] [2023-11-06 20:31:02,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20800551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:02,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:02,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 20:31:02,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479553099] [2023-11-06 20:31:02,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:02,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 20:31:02,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:02,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 20:31:02,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 20:31:02,432 INFO L87 Difference]: Start difference. First operand 725 states and 2082 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 20:31:02,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:02,729 INFO L93 Difference]: Finished difference Result 1283 states and 3565 transitions. [2023-11-06 20:31:02,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 20:31:02,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 20:31:02,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:02,734 INFO L225 Difference]: With dead ends: 1283 [2023-11-06 20:31:02,735 INFO L226 Difference]: Without dead ends: 1283 [2023-11-06 20:31:02,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:31:02,735 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 51 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:02,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 29 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:31:02,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2023-11-06 20:31:02,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 745. [2023-11-06 20:31:02,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 743 states have (on average 2.869448183041723) internal successors, (2132), 744 states have internal predecessors, (2132), 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 20:31:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 2132 transitions. [2023-11-06 20:31:02,771 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 2132 transitions. Word has length 22 [2023-11-06 20:31:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:02,772 INFO L495 AbstractCegarLoop]: Abstraction has 745 states and 2132 transitions. [2023-11-06 20:31:02,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 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 20:31:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 2132 transitions. [2023-11-06 20:31:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-06 20:31:02,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:02,775 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 20:31:02,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 20:31:02,776 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 20:31:02,777 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:02,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1576158778, now seen corresponding path program 2 times [2023-11-06 20:31:02,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:02,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227720198] [2023-11-06 20:31:02,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:02,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:03,069 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 20:31:03,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:03,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227720198] [2023-11-06 20:31:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227720198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:03,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:03,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 20:31:03,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164388895] [2023-11-06 20:31:03,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:03,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 20:31:03,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:03,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 20:31:03,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 20:31:03,072 INFO L87 Difference]: Start difference. First operand 745 states and 2132 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 20:31:03,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:03,264 INFO L93 Difference]: Finished difference Result 685 states and 1996 transitions. [2023-11-06 20:31:03,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 20:31:03,264 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 20:31:03,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:03,267 INFO L225 Difference]: With dead ends: 685 [2023-11-06 20:31:03,267 INFO L226 Difference]: Without dead ends: 657 [2023-11-06 20:31:03,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-06 20:31:03,268 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 67 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:03,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 24 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 20:31:03,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2023-11-06 20:31:03,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 585. [2023-11-06 20:31:03,286 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 20:31:03,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1756 transitions. [2023-11-06 20:31:03,289 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1756 transitions. Word has length 22 [2023-11-06 20:31:03,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:03,290 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 1756 transitions. [2023-11-06 20:31:03,290 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 20:31:03,290 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1756 transitions. [2023-11-06 20:31:03,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 20:31:03,293 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:03,293 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 20:31:03,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 20:31:03,293 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 20:31:03,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:03,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1785218068, now seen corresponding path program 1 times [2023-11-06 20:31:03,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:03,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629643076] [2023-11-06 20:31:03,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:03,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:03,553 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 20:31:03,554 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629643076] [2023-11-06 20:31:03,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629643076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:03,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:03,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 20:31:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210338286] [2023-11-06 20:31:03,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:03,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 20:31:03,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:03,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 20:31:03,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 20:31:03,556 INFO L87 Difference]: Start difference. First operand 585 states and 1756 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:03,640 INFO L93 Difference]: Finished difference Result 811 states and 2357 transitions. [2023-11-06 20:31:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 20:31:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-06 20:31:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:03,644 INFO L225 Difference]: With dead ends: 811 [2023-11-06 20:31:03,644 INFO L226 Difference]: Without dead ends: 811 [2023-11-06 20:31:03,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:31:03,646 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:03,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 7 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:03,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2023-11-06 20:31:03,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 749. [2023-11-06 20:31:03,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 747 states have (on average 2.9799196787148596) internal successors, (2226), 748 states have internal predecessors, (2226), 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 20:31:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 2226 transitions. [2023-11-06 20:31:03,672 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 2226 transitions. Word has length 25 [2023-11-06 20:31:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:03,673 INFO L495 AbstractCegarLoop]: Abstraction has 749 states and 2226 transitions. [2023-11-06 20:31:03,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 20:31:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 2226 transitions. [2023-11-06 20:31:03,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 20:31:03,676 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:03,676 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 20:31:03,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 20:31:03,677 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 20:31:03,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:03,677 INFO L85 PathProgramCache]: Analyzing trace with hash -163555734, now seen corresponding path program 2 times [2023-11-06 20:31:03,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:03,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410054920] [2023-11-06 20:31:03,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:03,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 20:31:03,889 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 20:31:03,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-06 20:31:03,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410054920] [2023-11-06 20:31:03,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410054920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 20:31:03,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 20:31:03,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 20:31:03,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247441780] [2023-11-06 20:31:03,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 20:31:03,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 20:31:03,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-06 20:31:03,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 20:31:03,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 20:31:03,892 INFO L87 Difference]: Start difference. First operand 749 states and 2226 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 20:31:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 20:31:04,014 INFO L93 Difference]: Finished difference Result 1035 states and 2993 transitions. [2023-11-06 20:31:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 20:31:04,015 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 20:31:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 20:31:04,019 INFO L225 Difference]: With dead ends: 1035 [2023-11-06 20:31:04,019 INFO L226 Difference]: Without dead ends: 1035 [2023-11-06 20:31:04,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:31:04,021 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 20:31:04,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 13 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 20:31:04,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2023-11-06 20:31:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 697. [2023-11-06 20:31:04,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 695 states have (on average 2.9755395683453236) internal successors, (2068), 696 states have internal predecessors, (2068), 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 20:31:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 2068 transitions. [2023-11-06 20:31:04,051 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 2068 transitions. Word has length 25 [2023-11-06 20:31:04,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 20:31:04,051 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 2068 transitions. [2023-11-06 20:31:04,051 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 20:31:04,052 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 2068 transitions. [2023-11-06 20:31:04,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-06 20:31:04,054 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 20:31:04,054 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 20:31:04,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 20:31:04,055 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 20:31:04,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 20:31:04,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1525433414, now seen corresponding path program 3 times [2023-11-06 20:31:04,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-06 20:31:04,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456213248] [2023-11-06 20:31:04,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 20:31:04,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 20:31:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:31:04,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 20:31:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 20:31:04,184 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-06 20:31:04,185 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 20:31:04,186 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-06 20:31:04,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-06 20:31:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-06 20:31:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-06 20:31:04,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-06 20:31:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-06 20:31:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-06 20:31:04,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-06 20:31:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-06 20:31:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-06 20:31:04,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-06 20:31:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-06 20:31:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-06 20:31:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-06 20:31:04,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-06 20:31:04,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-06 20:31:04,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 20:31:04,195 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 20:31:04,203 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 20:31:04,203 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 20:31:04,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:31:04 BasicIcfg [2023-11-06 20:31:04,328 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 20:31:04,329 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 20:31:04,329 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 20:31:04,330 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 20:31:04,330 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:30:49" (3/4) ... [2023-11-06 20:31:04,332 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-06 20:31:04,334 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 20:31:04,334 INFO L158 Benchmark]: Toolchain (without parser) took 16929.11ms. Allocated memory was 148.9MB in the beginning and 295.7MB in the end (delta: 146.8MB). Free memory was 104.9MB in the beginning and 95.5MB in the end (delta: 9.3MB). Peak memory consumption was 157.9MB. Max. memory is 16.1GB. [2023-11-06 20:31:04,335 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 113.2MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 20:31:04,335 INFO L158 Benchmark]: CACSL2BoogieTranslator took 640.36ms. Allocated memory is still 148.9MB. Free memory was 104.5MB in the beginning and 81.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-06 20:31:04,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.12ms. Allocated memory is still 148.9MB. Free memory was 81.4MB in the beginning and 79.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:31:04,336 INFO L158 Benchmark]: Boogie Preprocessor took 107.63ms. Allocated memory is still 148.9MB. Free memory was 78.6MB in the beginning and 119.8MB in the end (delta: -41.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2023-11-06 20:31:04,337 INFO L158 Benchmark]: RCFGBuilder took 839.48ms. Allocated memory is still 148.9MB. Free memory was 119.8MB in the beginning and 84.9MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2023-11-06 20:31:04,338 INFO L158 Benchmark]: TraceAbstraction took 15210.90ms. Allocated memory was 148.9MB in the beginning and 295.7MB in the end (delta: 146.8MB). Free memory was 84.3MB in the beginning and 96.6MB in the end (delta: -12.3MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. [2023-11-06 20:31:04,338 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 295.7MB. Free memory was 96.6MB in the beginning and 95.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 20:31:04,340 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.28ms. Allocated memory is still 113.2MB. Free memory is still 61.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 640.36ms. Allocated memory is still 148.9MB. Free memory was 104.5MB in the beginning and 81.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 116.12ms. Allocated memory is still 148.9MB. Free memory was 81.4MB in the beginning and 79.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 107.63ms. Allocated memory is still 148.9MB. Free memory was 78.6MB in the beginning and 119.8MB in the end (delta: -41.2MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * RCFGBuilder took 839.48ms. Allocated memory is still 148.9MB. Free memory was 119.8MB in the beginning and 84.9MB in the end (delta: 34.8MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15210.90ms. Allocated memory was 148.9MB in the beginning and 295.7MB in the end (delta: 146.8MB). Free memory was 84.3MB in the beginning and 96.6MB in the end (delta: -12.3MB). Peak memory consumption was 134.2MB. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 295.7MB. Free memory was 96.6MB in the beginning and 95.5MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.5s, 160 PlacesBefore, 54 PlacesAfterwards, 150 TransitionsBefore, 42 TransitionsAfterwards, 3632 CoEnabledTransitionPairs, 8 FixpointIterations, 54 TrivialSequentialCompositions, 89 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 156 TotalNumberOfCompositions, 9309 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4841, independent: 4624, independent conditional: 0, independent unconditional: 4624, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2569, independent: 2507, independent conditional: 0, independent unconditional: 2507, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2569, independent: 2481, independent conditional: 0, independent unconditional: 2481, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 292, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 235, dependent conditional: 0, dependent unconditional: 235, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4841, independent: 2117, independent conditional: 0, independent unconditional: 2117, dependent: 155, dependent conditional: 0, dependent unconditional: 155, unknown: 2569, unknown conditional: 0, unknown unconditional: 2569] , Statistics on independence cache: Total cache size (in pairs): 270, Positive cache size: 247, Positive conditional cache size: 0, Positive unconditional cache size: 247, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 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; [L856] 0 pthread_t t973; [L857] FCALL, FORK 0 pthread_create(&t973, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t973, ((void *)0), P0, ((void *)0))=8, t973={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] [L858] 0 pthread_t t974; [L859] FCALL, FORK 0 pthread_create(&t974, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t974, ((void *)0), P1, ((void *)0))=9, t973={5:0}, t974={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] [L860] 0 pthread_t t975; [L861] FCALL, FORK 0 pthread_create(&t975, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t975, ((void *)0), P2, ((void *)0))=10, t973={5:0}, t974={6:0}, t975={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] [L862] 0 pthread_t t976; [L863] FCALL, FORK 0 pthread_create(&t976, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t976, ((void *)0), P3, ((void *)0))=11, t973={5:0}, t974={6:0}, t975={7:0}, t976={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_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}, b=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 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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}, b=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] [L831] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=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}, b=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] [L754] 1 b = 1 VAL [__unbuffered_cnt=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}, b=1, 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] [L757] 1 x = 1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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] [L769] 2 x = 2 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L784] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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}, \result={0:0}, __unbuffered_cnt=2, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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; [L834] 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) [L835] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L836] 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 [L837] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L838] 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}, \result={0:0}, __unbuffered_cnt=3, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, 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] [L841] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L843] 4 return 0; [L865] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L867] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L867] RET 0 assume_abort_if_not(main$tmp_guard0) [L869] 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) [L870] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L871] 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 [L872] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L873] 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_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t973={5:0}, t974={6:0}, t975={7:0}, t976={3:0}, weak$$choice2=1, x=2, 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] [L876] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] 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", "mix037.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_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, 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: 854]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: 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: 859]: 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: 857]: 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: 861]: 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, 184 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 429 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 429 mSDsluCounter, 208 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1291 IncrementalHoareTripleChecker+Invalid, 1321 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 72 mSDtfsCounter, 1291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3156occurred in iteration=0, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 1830 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 214 NumberOfCodeBlocks, 214 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 177 ConstructedInterpolants, 0 QuantifiedInterpolants, 926 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 20:31:04,369 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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 be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 20:31:07,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 20:31:07,239 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-06 20:31:07,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 20:31:07,251 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 20:31:07,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 20:31:07,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 20:31:07,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 20:31:07,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 20:31:07,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 20:31:07,307 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-06 20:31:07,307 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-06 20:31:07,308 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-06 20:31:07,310 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-06 20:31:07,310 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-06 20:31:07,311 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-06 20:31:07,311 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 20:31:07,312 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 20:31:07,313 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 20:31:07,314 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 20:31:07,314 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 20:31:07,315 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 20:31:07,315 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 20:31:07,316 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 20:31:07,316 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 20:31:07,317 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 20:31:07,317 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 20:31:07,318 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 20:31:07,318 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 20:31:07,319 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 20:31:07,320 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 20:31:07,321 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 20:31:07,321 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 20:31:07,321 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 20:31:07,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 20:31:07,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 20:31:07,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:31:07,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 20:31:07,324 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 20:31:07,324 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-06 20:31:07,324 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 20:31:07,325 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-06 20:31:07,325 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 20:31:07,325 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_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/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 -> be02b321ccd6bac38d207cd4c595c173c1a2ce3b705272ff0087ad749834a1ef [2023-11-06 20:31:07,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 20:31:07,838 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 20:31:07,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 20:31:07,842 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 20:31:07,843 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 20:31:07,844 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/../../sv-benchmarks/c/pthread-wmm/mix037.opt.i [2023-11-06 20:31:11,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 20:31:11,400 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 20:31:11,412 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/sv-benchmarks/c/pthread-wmm/mix037.opt.i [2023-11-06 20:31:11,436 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/data/ca6e60a91/fb6cb412e8554912b9213855eb72801d/FLAGd82e8878a [2023-11-06 20:31:11,452 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/data/ca6e60a91/fb6cb412e8554912b9213855eb72801d [2023-11-06 20:31:11,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 20:31:11,456 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 20:31:11,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 20:31:11,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 20:31:11,466 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 20:31:11,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@648611a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:11, skipping insertion in model container [2023-11-06 20:31:11,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:31:11" (1/1) ... [2023-11-06 20:31:11,553 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 20:31:12,093 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:31:12,128 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 20:31:12,218 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 20:31:12,265 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 20:31:12,268 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 20:31:12,276 INFO L206 MainTranslator]: Completed translation [2023-11-06 20:31:12,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12 WrapperNode [2023-11-06 20:31:12,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 20:31:12,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 20:31:12,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 20:31:12,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 20:31:12,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,337 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 158 [2023-11-06 20:31:12,337 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 20:31:12,338 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 20:31:12,338 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 20:31:12,338 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 20:31:12,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,372 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,386 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 20:31:12,387 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 20:31:12,387 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 20:31:12,388 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 20:31:12,388 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (1/1) ... [2023-11-06 20:31:12,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 20:31:12,412 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/z3 [2023-11-06 20:31:12,426 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 20:31:12,441 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bb9f32d-8cac-42dc-b3c3-5b63aadbd5fc/bin/utaipan-verify-FOvIYxoinp/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 20:31:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 20:31:12,477 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 20:31:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 20:31:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 20:31:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 20:31:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 20:31:12,478 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-06 20:31:12,478 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-06 20:31:12,479 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-06 20:31:12,481 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-06 20:31:12,481 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-06 20:31:12,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-06 20:31:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-06 20:31:12,482 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-06 20:31:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 20:31:12,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 20:31:12,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 20:31:12,484 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 20:31:12,667 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 20:31:12,670 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 20:31:13,220 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 20:31:13,372 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 20:31:13,372 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 20:31:13,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:13 BoogieIcfgContainer [2023-11-06 20:31:13,375 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 20:31:13,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 20:31:13,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 20:31:13,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 20:31:13,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:31:11" (1/3) ... [2023-11-06 20:31:13,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755540d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:31:13, skipping insertion in model container [2023-11-06 20:31:13,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:31:12" (2/3) ... [2023-11-06 20:31:13,388 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755540d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:31:13, skipping insertion in model container [2023-11-06 20:31:13,388 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:31:13" (3/3) ... [2023-11-06 20:31:13,389 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037.opt.i [2023-11-06 20:31:13,408 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 20:31:13,409 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-06 20:31:13,409 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 20:31:13,517 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 20:31:13,564 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-06 20:31:13,582 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 151 transitions, 318 flow [2023-11-06 20:31:13,585 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 151 transitions, 318 flow [2023-11-06 20:31:13,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 318 flow [2023-11-06 20:31:13,659 INFO L124 PetriNetUnfolderBase]: 3/147 cut-off events. [2023-11-06 20:31:13,659 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 20:31:13,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 147 events. 3/147 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 108 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 104. Up to 2 conditions per place. [2023-11-06 20:31:13,670 INFO L119 LiptonReduction]: Number of co-enabled transitions 3632