./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:57:56,666 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:57:56,779 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-14 03:57:56,789 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:57:56,789 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:57:56,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:57:56,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:57:56,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:57:56,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:57:56,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:57:56,821 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:57:56,822 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:57:56,822 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:57:56,822 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-14 03:57:56,822 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:57:56,822 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:57:56,823 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-14 03:57:56,823 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-14 03:57:56,823 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:57:56,823 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-14 03:57:56,823 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-14 03:57:56,824 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-14 03:57:56,824 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:57:56,824 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:57:56,825 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:57:56,825 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:57:56,825 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:57:56,825 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:57:56,825 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:57:56,825 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:57:56,825 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:57:56,826 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:57:56,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:57:56,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:57:56,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:57:56,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:57:56,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:57:56,829 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:57:56,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:57:56,829 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:57:56,830 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:57:56,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:57:56,830 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:57:56,830 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:57:56,830 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-14 03:57:56,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-14 03:57:56,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:57:56,830 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:57:56,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-14 03:57:56,831 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2024-11-14 03:57:57,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:57:57,223 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:57:57,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:57:57,227 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:57:57,228 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:57:57,229 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i Unable to find full path for "g++" [2024-11-14 03:57:59,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:57:59,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:57:59,859 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2024-11-14 03:57:59,885 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/data/a762a0537/a03a5ba2046d4fff8a0403d893bfaf1b/FLAG3feeccb29 [2024-11-14 03:57:59,907 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/data/a762a0537/a03a5ba2046d4fff8a0403d893bfaf1b [2024-11-14 03:57:59,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:57:59,912 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:57:59,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:57:59,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:57:59,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:57:59,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:57:59" (1/1) ... [2024-11-14 03:57:59,922 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f45b44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:57:59, skipping insertion in model container [2024-11-14 03:57:59,922 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:57:59" (1/1) ... [2024-11-14 03:57:59,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:58:00,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:58:00,649 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:58:00,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:58:00,833 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:58:00,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00 WrapperNode [2024-11-14 03:58:00,834 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:58:00,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:58:00,836 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:58:00,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:58:00,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,917 INFO L138 Inliner]: procedures = 175, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2024-11-14 03:58:00,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:58:00,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:58:00,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:58:00,919 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:58:00,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,932 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,946 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,951 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:58:00,952 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:58:00,953 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:58:00,953 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:58:00,954 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (1/1) ... [2024-11-14 03:58:00,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:58:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:58:01,001 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:58:01,007 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:58:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 03:58:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:58:01,041 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 03:58:01,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 03:58:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 03:58:01,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 03:58:01,042 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-14 03:58:01,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-14 03:58:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-14 03:58:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 03:58:01,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:58:01,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:58:01,044 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 03:58:01,262 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:58:01,264 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:58:01,753 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:58:01,756 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:58:02,177 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:58:02,180 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 03:58:02,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:58:02 BoogieIcfgContainer [2024-11-14 03:58:02,180 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:58:02,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:58:02,186 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:58:02,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:58:02,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:57:59" (1/3) ... [2024-11-14 03:58:02,198 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d5c7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:58:02, skipping insertion in model container [2024-11-14 03:58:02,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:00" (2/3) ... [2024-11-14 03:58:02,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37d5c7da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:58:02, skipping insertion in model container [2024-11-14 03:58:02,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:58:02" (3/3) ... [2024-11-14 03:58:02,200 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2024-11-14 03:58:02,221 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:58:02,224 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix019_tso.oepc.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-14 03:58:02,224 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:58:02,346 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 03:58:02,393 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 45 transitions, 102 flow [2024-11-14 03:58:02,963 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6568 states, 6563 states have (on average 3.6533597440195034) internal successors, (23977), 6567 states have internal predecessors, (23977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:03,000 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:58:03,019 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ae10a59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:58:03,019 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-14 03:58:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 6568 states, 6563 states have (on average 3.6533597440195034) internal successors, (23977), 6567 states have internal predecessors, (23977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:58:03,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:03,068 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:58:03,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:03,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:03,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1262781850, now seen corresponding path program 1 times [2024-11-14 03:58:03,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:03,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008290357] [2024-11-14 03:58:03,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:03,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:03,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:03,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:03,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008290357] [2024-11-14 03:58:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008290357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:03,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:58:03,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652543147] [2024-11-14 03:58:03,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:03,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:58:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:03,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:58:03,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:58:03,927 INFO L87 Difference]: Start difference. First operand has 6568 states, 6563 states have (on average 3.6533597440195034) internal successors, (23977), 6567 states have internal predecessors, (23977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:04,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:04,328 INFO L93 Difference]: Finished difference Result 7856 states and 28392 transitions. [2024-11-14 03:58:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:58:04,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:58:04,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:04,446 INFO L225 Difference]: With dead ends: 7856 [2024-11-14 03:58:04,446 INFO L226 Difference]: Without dead ends: 5210 [2024-11-14 03:58:04,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:58:04,467 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:04,468 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:58:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5210 states. [2024-11-14 03:58:04,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5210 to 5210. [2024-11-14 03:58:05,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5210 states, 5208 states have (on average 3.493279569892473) internal successors, (18193), 5209 states have internal predecessors, (18193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 18193 transitions. [2024-11-14 03:58:05,093 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 18193 transitions. Word has length 6 [2024-11-14 03:58:05,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:05,094 INFO L471 AbstractCegarLoop]: Abstraction has 5210 states and 18193 transitions. [2024-11-14 03:58:05,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:05,096 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 18193 transitions. [2024-11-14 03:58:05,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:58:05,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:05,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:05,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-14 03:58:05,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:05,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:05,114 INFO L85 PathProgramCache]: Analyzing trace with hash 774293598, now seen corresponding path program 1 times [2024-11-14 03:58:05,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:05,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948372808] [2024-11-14 03:58:05,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:05,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:05,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:05,386 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:05,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948372808] [2024-11-14 03:58:05,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948372808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:05,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:58:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728922352] [2024-11-14 03:58:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:05,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:58:05,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:05,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:58:05,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:58:05,390 INFO L87 Difference]: Start difference. First operand 5210 states and 18193 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:05,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:05,589 INFO L93 Difference]: Finished difference Result 5210 states and 18193 transitions. [2024-11-14 03:58:05,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:58:05,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:58:05,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:05,649 INFO L225 Difference]: With dead ends: 5210 [2024-11-14 03:58:05,649 INFO L226 Difference]: Without dead ends: 4034 [2024-11-14 03:58:05,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:58:05,657 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:05,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 16 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:58:05,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4034 states. [2024-11-14 03:58:05,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4034 to 4034. [2024-11-14 03:58:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 4033 states have (on average 3.4644185469873543) internal successors, (13972), 4033 states have internal predecessors, (13972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 13972 transitions. [2024-11-14 03:58:05,983 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 13972 transitions. Word has length 15 [2024-11-14 03:58:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:05,984 INFO L471 AbstractCegarLoop]: Abstraction has 4034 states and 13972 transitions. [2024-11-14 03:58:05,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 13972 transitions. [2024-11-14 03:58:05,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:58:05,991 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:05,991 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:05,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-14 03:58:05,992 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:05,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:05,997 INFO L85 PathProgramCache]: Analyzing trace with hash 774295054, now seen corresponding path program 1 times [2024-11-14 03:58:05,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:05,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034469536] [2024-11-14 03:58:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:06,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:07,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:07,625 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:07,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034469536] [2024-11-14 03:58:07,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034469536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:07,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:07,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:58:07,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112204112] [2024-11-14 03:58:07,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:07,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:58:07,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:07,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:58:07,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:58:07,629 INFO L87 Difference]: Start difference. First operand 4034 states and 13972 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:08,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:08,103 INFO L93 Difference]: Finished difference Result 5259 states and 18032 transitions. [2024-11-14 03:58:08,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:58:08,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:58:08,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:08,139 INFO L225 Difference]: With dead ends: 5259 [2024-11-14 03:58:08,140 INFO L226 Difference]: Without dead ends: 3299 [2024-11-14 03:58:08,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:58:08,146 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 97 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:08,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 102 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:58:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3299 states. [2024-11-14 03:58:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3299 to 3299. [2024-11-14 03:58:08,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3299 states, 3298 states have (on average 3.4087325651910247) internal successors, (11242), 3298 states have internal predecessors, (11242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 11242 transitions. [2024-11-14 03:58:08,345 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 11242 transitions. Word has length 15 [2024-11-14 03:58:08,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:08,346 INFO L471 AbstractCegarLoop]: Abstraction has 3299 states and 11242 transitions. [2024-11-14 03:58:08,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 11242 transitions. [2024-11-14 03:58:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-14 03:58:08,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:08,355 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:08,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-14 03:58:08,356 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:08,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:08,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1154440949, now seen corresponding path program 1 times [2024-11-14 03:58:08,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:08,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845492197] [2024-11-14 03:58:08,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:09,550 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:09,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845492197] [2024-11-14 03:58:09,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845492197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:09,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:09,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:58:09,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486713151] [2024-11-14 03:58:09,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:09,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:58:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:09,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:58:09,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:58:09,553 INFO L87 Difference]: Start difference. First operand 3299 states and 11242 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:10,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:10,024 INFO L93 Difference]: Finished difference Result 4374 states and 14762 transitions. [2024-11-14 03:58:10,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-14 03:58:10,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-14 03:58:10,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:10,076 INFO L225 Difference]: With dead ends: 4374 [2024-11-14 03:58:10,077 INFO L226 Difference]: Without dead ends: 3149 [2024-11-14 03:58:10,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:58:10,084 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 66 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:10,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 102 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-14 03:58:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3149 states. [2024-11-14 03:58:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3149 to 3149. [2024-11-14 03:58:10,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 3148 states have (on average 3.390088945362135) internal successors, (10672), 3148 states have internal predecessors, (10672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:10,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 10672 transitions. [2024-11-14 03:58:10,219 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 10672 transitions. Word has length 18 [2024-11-14 03:58:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:10,220 INFO L471 AbstractCegarLoop]: Abstraction has 3149 states and 10672 transitions. [2024-11-14 03:58:10,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 10672 transitions. [2024-11-14 03:58:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:58:10,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:10,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:10,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-14 03:58:10,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:10,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:10,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1266461847, now seen corresponding path program 1 times [2024-11-14 03:58:10,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:10,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135845336] [2024-11-14 03:58:10,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:10,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:10,566 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135845336] [2024-11-14 03:58:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135845336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:10,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:58:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952610495] [2024-11-14 03:58:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:10,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:58:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:58:10,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:58:10,569 INFO L87 Difference]: Start difference. First operand 3149 states and 10672 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:10,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:10,761 INFO L93 Difference]: Finished difference Result 4665 states and 15446 transitions. [2024-11-14 03:58:10,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:58:10,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-14 03:58:10,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:10,785 INFO L225 Difference]: With dead ends: 4665 [2024-11-14 03:58:10,785 INFO L226 Difference]: Without dead ends: 2414 [2024-11-14 03:58:10,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:58:10,792 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 55 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:10,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 36 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:58:10,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2024-11-14 03:58:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2414. [2024-11-14 03:58:10,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2414 states, 2413 states have (on average 3.2043099875673438) internal successors, (7732), 2413 states have internal predecessors, (7732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2414 states to 2414 states and 7732 transitions. [2024-11-14 03:58:10,886 INFO L78 Accepts]: Start accepts. Automaton has 2414 states and 7732 transitions. Word has length 20 [2024-11-14 03:58:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:10,887 INFO L471 AbstractCegarLoop]: Abstraction has 2414 states and 7732 transitions. [2024-11-14 03:58:10,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 2414 states and 7732 transitions. [2024-11-14 03:58:10,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-14 03:58:10,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:10,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:10,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-14 03:58:10,894 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:10,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash 374020480, now seen corresponding path program 1 times [2024-11-14 03:58:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:10,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143932929] [2024-11-14 03:58:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:10,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:11,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:11,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:11,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143932929] [2024-11-14 03:58:11,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143932929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:11,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:11,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:58:11,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054498722] [2024-11-14 03:58:11,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:11,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:58:11,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:11,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:58:11,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:58:11,312 INFO L87 Difference]: Start difference. First operand 2414 states and 7732 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:11,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:11,568 INFO L93 Difference]: Finished difference Result 2930 states and 9176 transitions. [2024-11-14 03:58:11,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:58:11,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-14 03:58:11,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:11,583 INFO L225 Difference]: With dead ends: 2930 [2024-11-14 03:58:11,583 INFO L226 Difference]: Without dead ends: 1414 [2024-11-14 03:58:11,587 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:58:11,588 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 96 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:11,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 47 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:58:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-11-14 03:58:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1414. [2024-11-14 03:58:11,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 2.995046001415428) internal successors, (4232), 1413 states have internal predecessors, (4232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 4232 transitions. [2024-11-14 03:58:11,645 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 4232 transitions. Word has length 23 [2024-11-14 03:58:11,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:11,645 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 4232 transitions. [2024-11-14 03:58:11,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 4232 transitions. [2024-11-14 03:58:11,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-14 03:58:11,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:11,650 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:11,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-14 03:58:11,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:11,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:11,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1369358010, now seen corresponding path program 1 times [2024-11-14 03:58:11,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:11,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520538978] [2024-11-14 03:58:11,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:11,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:12,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:12,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520538978] [2024-11-14 03:58:12,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520538978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:12,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:12,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:58:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686851553] [2024-11-14 03:58:12,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:12,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:58:12,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:58:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:58:12,165 INFO L87 Difference]: Start difference. First operand 1414 states and 4232 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:12,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:12,390 INFO L93 Difference]: Finished difference Result 1478 states and 4384 transitions. [2024-11-14 03:58:12,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:58:12,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 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 26 [2024-11-14 03:58:12,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:12,403 INFO L225 Difference]: With dead ends: 1478 [2024-11-14 03:58:12,403 INFO L226 Difference]: Without dead ends: 962 [2024-11-14 03:58:12,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:58:12,407 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 117 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:12,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 37 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:58:12,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-14 03:58:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-11-14 03:58:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 2.9927159209157126) internal successors, (2876), 961 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2876 transitions. [2024-11-14 03:58:12,446 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2876 transitions. Word has length 26 [2024-11-14 03:58:12,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:12,446 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 2876 transitions. [2024-11-14 03:58:12,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:12,447 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2876 transitions. [2024-11-14 03:58:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:58:12,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:12,450 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:12,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-14 03:58:12,451 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:12,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:12,452 INFO L85 PathProgramCache]: Analyzing trace with hash -549785679, now seen corresponding path program 1 times [2024-11-14 03:58:12,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:12,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454121077] [2024-11-14 03:58:12,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:12,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:15,428 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-14 03:58:15,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454121077] [2024-11-14 03:58:15,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454121077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:15,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:15,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:58:15,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121726185] [2024-11-14 03:58:15,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:15,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:58:15,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-14 03:58:15,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:58:15,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:58:15,431 INFO L87 Difference]: Start difference. First operand 962 states and 2876 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:16,134 INFO L93 Difference]: Finished difference Result 1260 states and 3681 transitions. [2024-11-14 03:58:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-14 03:58:16,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 03:58:16,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:16,145 INFO L225 Difference]: With dead ends: 1260 [2024-11-14 03:58:16,145 INFO L226 Difference]: Without dead ends: 800 [2024-11-14 03:58:16,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2024-11-14 03:58:16,147 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 119 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:16,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 303 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-14 03:58:16,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-14 03:58:16,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2024-11-14 03:58:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.923654568210263) internal successors, (2336), 799 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2336 transitions. [2024-11-14 03:58:16,217 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2336 transitions. Word has length 31 [2024-11-14 03:58:16,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:16,217 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 2336 transitions. [2024-11-14 03:58:16,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2336 transitions. [2024-11-14 03:58:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:58:16,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:16,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:16,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-14 03:58:16,220 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:16,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:16,221 INFO L85 PathProgramCache]: Analyzing trace with hash 279257649, now seen corresponding path program 2 times [2024-11-14 03:58:16,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-14 03:58:16,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294344786] [2024-11-14 03:58:16,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:16,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-14 03:58:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:58:16,371 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:58:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:58:16,526 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-14 03:58:16,526 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:58:16,528 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-14 03:58:16,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-14 03:58:16,530 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-14 03:58:16,532 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-14 03:58:16,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-14 03:58:16,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-14 03:58:16,533 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-14 03:58:16,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-14 03:58:16,537 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:16,641 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 03:58:16,646 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:58:16,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:58:16 BasicIcfg [2024-11-14 03:58:16,651 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:58:16,651 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:58:16,652 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:58:16,652 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:58:16,653 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:58:02" (3/4) ... [2024-11-14 03:58:16,655 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:58:16,655 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:58:16,658 INFO L158 Benchmark]: Toolchain (without parser) took 16746.03ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 118.0MB in the beginning and 97.8MB in the end (delta: 20.2MB). Peak memory consumption was 129.4MB. Max. memory is 16.1GB. [2024-11-14 03:58:16,658 INFO L158 Benchmark]: CDTParser took 0.45ms. Allocated memory is still 142.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:58:16,658 INFO L158 Benchmark]: CACSL2BoogieTranslator took 920.78ms. Allocated memory is still 142.6MB. Free memory was 117.7MB in the beginning and 94.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:58:16,659 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.69ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:58:16,659 INFO L158 Benchmark]: Boogie Preprocessor took 33.37ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:58:16,660 INFO L158 Benchmark]: RCFGBuilder took 1228.22ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 108.6MB in the end (delta: -18.3MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2024-11-14 03:58:16,660 INFO L158 Benchmark]: TraceAbstraction took 14465.32ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 107.8MB in the beginning and 100.9MB in the end (delta: 6.9MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. [2024-11-14 03:58:16,661 INFO L158 Benchmark]: Witness Printer took 5.39ms. Allocated memory is still 251.7MB. Free memory was 100.9MB in the beginning and 97.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-14 03:58:16,663 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.45ms. Allocated memory is still 142.6MB. Free memory is still 81.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 920.78ms. Allocated memory is still 142.6MB. Free memory was 117.7MB in the beginning and 94.6MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.69ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.8MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.37ms. Allocated memory is still 142.6MB. Free memory was 91.8MB in the beginning and 90.3MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1228.22ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 108.6MB in the end (delta: -18.3MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14465.32ms. Allocated memory was 142.6MB in the beginning and 251.7MB in the end (delta: 109.1MB). Free memory was 107.8MB in the beginning and 100.9MB in the end (delta: 6.9MB). Peak memory consumption was 114.9MB. Max. memory is 16.1GB. * Witness Printer took 5.39ms. Allocated memory is still 251.7MB. Free memory was 100.9MB in the beginning and 97.8MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=-1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=-1, t516=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=-1, t516=0, t517=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=-1, t516=0, t517=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=-1, t516=0, t517=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=-1, t516=0, t517=1, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix019_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 14.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 596 mSDsluCounter, 676 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 493 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 845 IncrementalHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 183 mSDtfsCounter, 845 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6568occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 185 NumberOfCodeBlocks, 185 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 1223 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 03:58:16,698 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-14 03:58:19,756 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-14 03:58:19,922 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-14 03:58:19,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-14 03:58:19,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-14 03:58:19,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-14 03:58:19,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-14 03:58:19,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-14 03:58:19,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-14 03:58:19,961 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-14 03:58:19,961 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-14 03:58:19,961 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-14 03:58:19,961 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-14 03:58:19,961 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-14 03:58:19,961 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-14 03:58:19,961 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-14 03:58:19,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-14 03:58:19,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-14 03:58:19,962 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-14 03:58:19,962 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-14 03:58:19,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-14 03:58:19,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-14 03:58:19,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-14 03:58:19,963 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-14 03:58:19,963 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-14 03:58:19,963 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-14 03:58:19,967 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-14 03:58:19,967 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-14 03:58:19,967 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-14 03:58:19,967 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-14 03:58:19,967 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-14 03:58:19,967 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-14 03:58:19,967 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-14 03:58:19,968 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-14 03:58:19,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-14 03:58:19,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-14 03:58:19,968 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-14 03:58:19,968 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-14 03:58:19,968 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:58:19,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-14 03:58:19,968 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-14 03:58:19,968 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-14 03:58:19,969 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-14 03:58:19,969 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-14 03:58:19,969 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-14 03:58:19,969 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2024-11-14 03:58:20,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-14 03:58:20,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-14 03:58:20,394 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-14 03:58:20,396 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-14 03:58:20,397 INFO L274 PluginConnector]: CDTParser initialized [2024-11-14 03:58:20,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i Unable to find full path for "g++" [2024-11-14 03:58:22,731 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-14 03:58:23,189 INFO L384 CDTParser]: Found 1 translation units. [2024-11-14 03:58:23,190 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2024-11-14 03:58:23,217 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/data/3728c45f8/a4a6935d409b440f8a71bb42bb448a4d/FLAG6d71af72b [2024-11-14 03:58:23,245 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/data/3728c45f8/a4a6935d409b440f8a71bb42bb448a4d [2024-11-14 03:58:23,248 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-14 03:58:23,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-14 03:58:23,253 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-14 03:58:23,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-14 03:58:23,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-14 03:58:23,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:58:23" (1/1) ... [2024-11-14 03:58:23,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd70e6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:23, skipping insertion in model container [2024-11-14 03:58:23,264 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:58:23" (1/1) ... [2024-11-14 03:58:23,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-14 03:58:23,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:58:23,894 INFO L200 MainTranslator]: Completed pre-run [2024-11-14 03:58:23,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-14 03:58:24,058 INFO L204 MainTranslator]: Completed translation [2024-11-14 03:58:24,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24 WrapperNode [2024-11-14 03:58:24,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-14 03:58:24,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-14 03:58:24,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-14 03:58:24,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-14 03:58:24,070 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,089 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,155 INFO L138 Inliner]: procedures = 176, calls = 45, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 140 [2024-11-14 03:58:24,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-14 03:58:24,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-14 03:58:24,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-14 03:58:24,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-14 03:58:24,175 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,185 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,185 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-14 03:58:24,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-14 03:58:24,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-14 03:58:24,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-14 03:58:24,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (1/1) ... [2024-11-14 03:58:24,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-14 03:58:24,277 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/z3 [2024-11-14 03:58:24,292 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-14 03:58:24,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-14 03:58:24,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-14 03:58:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-14 03:58:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-14 03:58:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-14 03:58:24,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-14 03:58:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-14 03:58:24,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-14 03:58:24,330 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-14 03:58:24,330 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-14 03:58:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-14 03:58:24,331 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-14 03:58:24,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-14 03:58:24,333 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-14 03:58:24,522 INFO L238 CfgBuilder]: Building ICFG [2024-11-14 03:58:24,524 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-14 03:58:25,114 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-14 03:58:25,114 INFO L287 CfgBuilder]: Performing block encoding [2024-11-14 03:58:25,511 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-14 03:58:25,511 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-14 03:58:25,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:58:25 BoogieIcfgContainer [2024-11-14 03:58:25,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-14 03:58:25,515 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-14 03:58:25,515 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-14 03:58:25,532 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-14 03:58:25,532 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:58:23" (1/3) ... [2024-11-14 03:58:25,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57907e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:58:25, skipping insertion in model container [2024-11-14 03:58:25,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:58:24" (2/3) ... [2024-11-14 03:58:25,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57907e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:58:25, skipping insertion in model container [2024-11-14 03:58:25,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:58:25" (3/3) ... [2024-11-14 03:58:25,537 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2024-11-14 03:58:25,558 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-14 03:58:25,560 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG mix019_tso.oepc.i that has 4 procedures, 44 locations, 1 initial locations, 0 loop locations, and 3 error locations. [2024-11-14 03:58:25,562 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-14 03:58:25,662 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-14 03:58:25,707 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 53 places, 45 transitions, 102 flow [2024-11-14 03:58:26,322 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6568 states, 6563 states have (on average 3.6533597440195034) internal successors, (23977), 6567 states have internal predecessors, (23977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:26,366 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-14 03:58:26,384 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b2900c4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-14 03:58:26,385 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-14 03:58:26,414 INFO L276 IsEmpty]: Start isEmpty. Operand has 6568 states, 6563 states have (on average 3.6533597440195034) internal successors, (23977), 6567 states have internal predecessors, (23977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-14 03:58:26,425 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:26,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-14 03:58:26,430 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:26,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:26,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1203614938, now seen corresponding path program 1 times [2024-11-14 03:58:26,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:26,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915598345] [2024-11-14 03:58:26,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:26,453 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:26,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:26,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:26,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-14 03:58:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:26,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:58:26,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:26,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:26,694 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:26,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915598345] [2024-11-14 03:58:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915598345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:26,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:58:26,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525720480] [2024-11-14 03:58:26,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:26,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:58:26,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:26,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:58:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:58:26,767 INFO L87 Difference]: Start difference. First operand has 6568 states, 6563 states have (on average 3.6533597440195034) internal successors, (23977), 6567 states have internal predecessors, (23977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:27,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:27,241 INFO L93 Difference]: Finished difference Result 7856 states and 28392 transitions. [2024-11-14 03:58:27,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:58:27,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-14 03:58:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:27,385 INFO L225 Difference]: With dead ends: 7856 [2024-11-14 03:58:27,385 INFO L226 Difference]: Without dead ends: 5210 [2024-11-14 03:58:27,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:58:27,403 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:27,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 33 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:58:27,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5210 states. [2024-11-14 03:58:27,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5210 to 5210. [2024-11-14 03:58:27,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5210 states, 5208 states have (on average 3.493279569892473) internal successors, (18193), 5209 states have internal predecessors, (18193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5210 states to 5210 states and 18193 transitions. [2024-11-14 03:58:27,949 INFO L78 Accepts]: Start accepts. Automaton has 5210 states and 18193 transitions. Word has length 6 [2024-11-14 03:58:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:27,949 INFO L471 AbstractCegarLoop]: Abstraction has 5210 states and 18193 transitions. [2024-11-14 03:58:27,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5210 states and 18193 transitions. [2024-11-14 03:58:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-14 03:58:27,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:27,960 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:27,968 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-14 03:58:28,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:28,164 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:28,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash 167595680, now seen corresponding path program 1 times [2024-11-14 03:58:28,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:28,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [712951363] [2024-11-14 03:58:28,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:28,171 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:28,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:28,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:28,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-14 03:58:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:28,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-14 03:58:28,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:28,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:28,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:28,413 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:28,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [712951363] [2024-11-14 03:58:28,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [712951363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:28,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:28,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-14 03:58:28,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939790832] [2024-11-14 03:58:28,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:28,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-14 03:58:28,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:28,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-14 03:58:28,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-14 03:58:28,418 INFO L87 Difference]: Start difference. First operand 5210 states and 18193 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:28,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:28,798 INFO L93 Difference]: Finished difference Result 7872 states and 26828 transitions. [2024-11-14 03:58:28,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-14 03:58:28,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-14 03:58:28,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:28,841 INFO L225 Difference]: With dead ends: 7872 [2024-11-14 03:58:28,841 INFO L226 Difference]: Without dead ends: 3560 [2024-11-14 03:58:28,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:58:28,855 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 60 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:28,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 42 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-14 03:58:28,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3560 states. [2024-11-14 03:58:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3560 to 3560. [2024-11-14 03:58:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3560 states, 3558 states have (on average 3.258291174817313) internal successors, (11593), 3559 states have internal predecessors, (11593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3560 states to 3560 states and 11593 transitions. [2024-11-14 03:58:29,086 INFO L78 Accepts]: Start accepts. Automaton has 3560 states and 11593 transitions. Word has length 15 [2024-11-14 03:58:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:29,087 INFO L471 AbstractCegarLoop]: Abstraction has 3560 states and 11593 transitions. [2024-11-14 03:58:29,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:29,088 INFO L276 IsEmpty]: Start isEmpty. Operand 3560 states and 11593 transitions. [2024-11-14 03:58:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-14 03:58:29,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:29,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:29,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-14 03:58:29,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:29,296 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:29,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:29,296 INFO L85 PathProgramCache]: Analyzing trace with hash 332088371, now seen corresponding path program 1 times [2024-11-14 03:58:29,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:29,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541458082] [2024-11-14 03:58:29,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:29,297 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:29,297 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:29,301 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:29,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-14 03:58:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:29,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-14 03:58:29,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:29,556 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:29,556 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541458082] [2024-11-14 03:58:29,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541458082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:29,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:29,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-14 03:58:29,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467811952] [2024-11-14 03:58:29,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:29,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-14 03:58:29,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:29,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-14 03:58:29,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-14 03:58:29,559 INFO L87 Difference]: Start difference. First operand 3560 states and 11593 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:29,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:29,901 INFO L93 Difference]: Finished difference Result 4352 states and 13853 transitions. [2024-11-14 03:58:29,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-14 03:58:29,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-14 03:58:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:29,927 INFO L225 Difference]: With dead ends: 4352 [2024-11-14 03:58:29,927 INFO L226 Difference]: Without dead ends: 1690 [2024-11-14 03:58:29,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-14 03:58:29,937 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 99 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:29,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 64 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:58:29,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1690 states. [2024-11-14 03:58:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1690 to 1690. [2024-11-14 03:58:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1690 states, 1688 states have (on average 2.990521327014218) internal successors, (5048), 1689 states have internal predecessors, (5048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1690 states to 1690 states and 5048 transitions. [2024-11-14 03:58:30,096 INFO L78 Accepts]: Start accepts. Automaton has 1690 states and 5048 transitions. Word has length 20 [2024-11-14 03:58:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:30,100 INFO L471 AbstractCegarLoop]: Abstraction has 1690 states and 5048 transitions. [2024-11-14 03:58:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 1690 states and 5048 transitions. [2024-11-14 03:58:30,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-14 03:58:30,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:30,114 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:30,126 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-14 03:58:30,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:30,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:30,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:30,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1666653434, now seen corresponding path program 1 times [2024-11-14 03:58:30,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:30,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017844087] [2024-11-14 03:58:30,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:30,322 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:30,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:30,325 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:30,328 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-14 03:58:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:30,482 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-14 03:58:30,485 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:30,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:30,588 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017844087] [2024-11-14 03:58:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017844087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:30,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:30,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-14 03:58:30,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604872012] [2024-11-14 03:58:30,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:30,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-14 03:58:30,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:30,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-14 03:58:30,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-14 03:58:30,590 INFO L87 Difference]: Start difference. First operand 1690 states and 5048 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:30,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:30,929 INFO L93 Difference]: Finished difference Result 1778 states and 5260 transitions. [2024-11-14 03:58:30,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-14 03:58:30,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-14 03:58:30,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:30,947 INFO L225 Difference]: With dead ends: 1778 [2024-11-14 03:58:30,947 INFO L226 Difference]: Without dead ends: 986 [2024-11-14 03:58:30,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-14 03:58:30,951 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 118 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:30,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 101 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:58:30,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-11-14 03:58:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2024-11-14 03:58:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 984 states have (on average 2.983739837398374) internal successors, (2936), 985 states have internal predecessors, (2936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:31,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 2936 transitions. [2024-11-14 03:58:31,011 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 2936 transitions. Word has length 25 [2024-11-14 03:58:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:31,012 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 2936 transitions. [2024-11-14 03:58:31,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 2936 transitions. [2024-11-14 03:58:31,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:58:31,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:31,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:31,022 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-14 03:58:31,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:31,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:31,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:31,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1104672323, now seen corresponding path program 1 times [2024-11-14 03:58:31,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:31,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1224305213] [2024-11-14 03:58:31,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:31,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:31,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:31,226 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:31,230 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-14 03:58:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:31,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-14 03:58:31,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:31,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:31,486 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:31,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1224305213] [2024-11-14 03:58:31,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1224305213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:31,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-14 03:58:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126850863] [2024-11-14 03:58:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:31,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-14 03:58:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:31,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-14 03:58:31,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:58:31,489 INFO L87 Difference]: Start difference. First operand 986 states and 2936 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:31,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:31,557 INFO L93 Difference]: Finished difference Result 986 states and 2936 transitions. [2024-11-14 03:58:31,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-14 03:58:31,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 03:58:31,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:31,575 INFO L225 Difference]: With dead ends: 986 [2024-11-14 03:58:31,575 INFO L226 Difference]: Without dead ends: 962 [2024-11-14 03:58:31,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-14 03:58:31,577 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:31,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 16 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-14 03:58:31,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2024-11-14 03:58:31,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2024-11-14 03:58:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 961 states have (on average 2.9927159209157126) internal successors, (2876), 961 states have internal predecessors, (2876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:31,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2876 transitions. [2024-11-14 03:58:31,633 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2876 transitions. Word has length 31 [2024-11-14 03:58:31,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:31,634 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 2876 transitions. [2024-11-14 03:58:31,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:31,634 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2876 transitions. [2024-11-14 03:58:31,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:58:31,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:31,640 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:31,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-14 03:58:31,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:31,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:31,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1104673779, now seen corresponding path program 1 times [2024-11-14 03:58:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977486212] [2024-11-14 03:58:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-14 03:58:31,847 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:31,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:31,849 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:31,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-14 03:58:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-14 03:58:32,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-14 03:58:32,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-14 03:58:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-14 03:58:33,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-14 03:58:33,251 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-14 03:58:33,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977486212] [2024-11-14 03:58:33,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977486212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-14 03:58:33,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-14 03:58:33,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-14 03:58:33,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942071975] [2024-11-14 03:58:33,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-14 03:58:33,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-14 03:58:33,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-14 03:58:33,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-14 03:58:33,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-14 03:58:33,254 INFO L87 Difference]: Start difference. First operand 962 states and 2876 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-14 03:58:33,874 INFO L93 Difference]: Finished difference Result 1242 states and 3630 transitions. [2024-11-14 03:58:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-14 03:58:33,875 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-14 03:58:33,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-14 03:58:33,888 INFO L225 Difference]: With dead ends: 1242 [2024-11-14 03:58:33,888 INFO L226 Difference]: Without dead ends: 800 [2024-11-14 03:58:33,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-11-14 03:58:33,891 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 163 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-14 03:58:33,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 169 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-14 03:58:33,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-14 03:58:33,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2024-11-14 03:58:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 799 states have (on average 2.923654568210263) internal successors, (2336), 799 states have internal predecessors, (2336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 2336 transitions. [2024-11-14 03:58:33,926 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 2336 transitions. Word has length 31 [2024-11-14 03:58:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-14 03:58:33,927 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 2336 transitions. [2024-11-14 03:58:33,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-14 03:58:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 2336 transitions. [2024-11-14 03:58:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-14 03:58:33,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-14 03:58:33,931 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-14 03:58:33,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-14 03:58:34,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:34,135 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-14 03:58:34,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-14 03:58:34,136 INFO L85 PathProgramCache]: Analyzing trace with hash 874524275, now seen corresponding path program 2 times [2024-11-14 03:58:34,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-14 03:58:34,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [900172480] [2024-11-14 03:58:34,137 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-14 03:58:34,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:34,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat [2024-11-14 03:58:34,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-14 03:58:34,144 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-14 03:58:34,290 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-14 03:58:34,290 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-14 03:58:34,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-14 03:58:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-14 03:58:34,456 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2024-11-14 03:58:34,456 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-14 03:58:34,457 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-14 03:58:34,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-14 03:58:34,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-14 03:58:34,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-14 03:58:34,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-14 03:58:34,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-14 03:58:34,461 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-14 03:58:34,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-14 03:58:34,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-14 03:58:34,664 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2024-11-14 03:58:34,752 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-14 03:58:34,752 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-14 03:58:34,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 03:58:34 BasicIcfg [2024-11-14 03:58:34,760 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-14 03:58:34,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-14 03:58:34,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-14 03:58:34,762 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-14 03:58:34,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:58:25" (3/4) ... [2024-11-14 03:58:34,770 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-14 03:58:34,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-14 03:58:34,772 INFO L158 Benchmark]: Toolchain (without parser) took 11521.55ms. Allocated memory was 83.9MB in the beginning and 369.1MB in the end (delta: 285.2MB). Free memory was 56.6MB in the beginning and 227.2MB in the end (delta: -170.5MB). Peak memory consumption was 116.3MB. Max. memory is 16.1GB. [2024-11-14 03:58:34,772 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 83.9MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:58:34,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 806.29ms. Allocated memory is still 83.9MB. Free memory was 56.6MB in the beginning and 33.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-14 03:58:34,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.81ms. Allocated memory is still 83.9MB. Free memory was 33.1MB in the beginning and 30.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:58:34,774 INFO L158 Benchmark]: Boogie Preprocessor took 75.96ms. Allocated memory is still 83.9MB. Free memory was 30.6MB in the beginning and 29.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:58:34,774 INFO L158 Benchmark]: RCFGBuilder took 1275.07ms. Allocated memory is still 83.9MB. Free memory was 29.0MB in the beginning and 24.1MB in the end (delta: 4.9MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-14 03:58:34,775 INFO L158 Benchmark]: TraceAbstraction took 9245.60ms. Allocated memory was 83.9MB in the beginning and 369.1MB in the end (delta: 285.2MB). Free memory was 23.7MB in the beginning and 227.2MB in the end (delta: -203.5MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2024-11-14 03:58:34,776 INFO L158 Benchmark]: Witness Printer took 9.56ms. Allocated memory is still 369.1MB. Free memory was 227.2MB in the beginning and 227.2MB in the end (delta: 13.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-14 03:58:34,778 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.66ms. Allocated memory is still 83.9MB. Free memory is still 63.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 806.29ms. Allocated memory is still 83.9MB. Free memory was 56.6MB in the beginning and 33.1MB in the end (delta: 23.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.81ms. Allocated memory is still 83.9MB. Free memory was 33.1MB in the beginning and 30.6MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 75.96ms. Allocated memory is still 83.9MB. Free memory was 30.6MB in the beginning and 29.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1275.07ms. Allocated memory is still 83.9MB. Free memory was 29.0MB in the beginning and 24.1MB in the end (delta: 4.9MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9245.60ms. Allocated memory was 83.9MB in the beginning and 369.1MB in the end (delta: 285.2MB). Free memory was 23.7MB in the beginning and 227.2MB in the end (delta: -203.5MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. * Witness Printer took 9.56ms. Allocated memory is still 369.1MB. Free memory was 227.2MB in the beginning and 227.2MB in the end (delta: 13.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=0, t516=1, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t515=0, t516=1, t517=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L794] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L745] 1 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L748] 1 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=0, t516=1, t517=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=0, t516=1, t517=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515=0, t516=1, t517=2, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix019_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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: 826]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 70 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 9.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 470 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 425 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 587 IncrementalHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 136 mSDtfsCounter, 587 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6568occurred in iteration=0, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 122 ConstructedInterpolants, 0 QuantifiedInterpolants, 712 SizeOfPredicates, 6 NumberOfNonLiveVariables, 655 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-14 03:58:34,825 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7dfe2ec0-5d9f-41a7-a429-69a1ccc83564/bin/utaipan-verify-sOmjnqqW8E/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample