./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:25:57,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:25:57,747 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-02 12:25:57,753 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:25:57,754 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:25:57,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:25:57,791 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:25:57,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:25:57,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:25:57,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:25:57,795 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:25:57,795 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:25:57,795 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:25:57,796 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:25:57,796 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:25:57,800 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:25:57,800 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:25:57,801 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:25:57,801 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:25:57,801 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:25:57,801 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:25:57,802 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:25:57,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 12:25:57,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 12:25:57,803 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:25:57,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 12:25:57,803 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:25:57,804 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 12:25:57,804 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:25:57,804 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 12:25:57,804 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 12:25:57,804 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 12:25:57,805 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:25:57,805 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 12:25:57,808 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:25:57,808 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 12:25:57,808 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 12:25:57,809 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:25:57,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:25:57,810 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:25:57,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:25:57,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:25:57,811 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:25:57,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:25:57,812 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:25:57,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:25:57,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:25:57,812 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:25:57,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:25:57,813 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e [2024-11-02 12:25:58,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:25:58,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:25:58,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:25:58,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:25:58,153 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:25:58,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/pthread-wmm/mix032.oepc.i Unable to find full path for "g++" [2024-11-02 12:26:00,411 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:26:00,682 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:26:00,685 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/sv-benchmarks/c/pthread-wmm/mix032.oepc.i [2024-11-02 12:26:00,716 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/data/95a1ae932/93bd696d5d2f4b4c85a8d4583e9ed189/FLAG2918b2201 [2024-11-02 12:26:00,758 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/data/95a1ae932/93bd696d5d2f4b4c85a8d4583e9ed189 [2024-11-02 12:26:00,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:26:00,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:26:00,764 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:26:00,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:26:00,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:26:00,773 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:26:00" (1/1) ... [2024-11-02 12:26:00,774 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e6e6a9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:00, skipping insertion in model container [2024-11-02 12:26:00,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:26:00" (1/1) ... [2024-11-02 12:26:00,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:26:01,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:26:01,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:26:01,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:26:01,569 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:26:01,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01 WrapperNode [2024-11-02 12:26:01,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:26:01,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:26:01,570 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:26:01,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:26:01,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,647 INFO L138 Inliner]: procedures = 175, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 124 [2024-11-02 12:26:01,648 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:26:01,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:26:01,649 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:26:01,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:26:01,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,658 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,664 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,665 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,692 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:26:01,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:26:01,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:26:01,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:26:01,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (1/1) ... [2024-11-02 12:26:01,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:26:01,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:26:01,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:26:01,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:26:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-02 12:26:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 12:26:01,783 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-02 12:26:01,783 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-02 12:26:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-02 12:26:01,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-02 12:26:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-02 12:26:01,784 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-02 12:26:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-02 12:26:01,784 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-02 12:26:01,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:26:01,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:26:01,787 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-02 12:26:02,010 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:26:02,013 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:26:02,567 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-02 12:26:02,567 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:26:02,861 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:26:02,865 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-02 12:26:02,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:26:02 BoogieIcfgContainer [2024-11-02 12:26:02,865 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:26:02,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:26:02,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:26:02,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:26:02,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:26:00" (1/3) ... [2024-11-02 12:26:02,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca8fa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:26:02, skipping insertion in model container [2024-11-02 12:26:02,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:01" (2/3) ... [2024-11-02 12:26:02,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ca8fa3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:26:02, skipping insertion in model container [2024-11-02 12:26:02,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:26:02" (3/3) ... [2024-11-02 12:26:02,882 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2024-11-02 12:26:02,901 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:26:02,902 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-02 12:26:02,902 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-02 12:26:02,973 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-02 12:26:03,012 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 48 transitions, 108 flow [2024-11-02 12:26:03,622 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9477 states, 9472 states have (on average 3.7006967905405403) internal successors, (35053), 9476 states have internal predecessors, (35053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:03,658 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:26:03,667 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;@1a3c9d1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:26:03,667 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-02 12:26:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand has 9477 states, 9472 states have (on average 3.7006967905405403) internal successors, (35053), 9476 states have internal predecessors, (35053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 12:26:03,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:03,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 12:26:03,716 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:03,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash 12496480, now seen corresponding path program 1 times [2024-11-02 12:26:03,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:03,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430474279] [2024-11-02 12:26:03,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:03,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:03,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:04,280 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430474279] [2024-11-02 12:26:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430474279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:04,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:04,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:26:04,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643583497] [2024-11-02 12:26:04,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:04,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:26:04,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:04,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:26:04,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:04,335 INFO L87 Difference]: Start difference. First operand has 9477 states, 9472 states have (on average 3.7006967905405403) internal successors, (35053), 9476 states have internal predecessors, (35053), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:04,795 INFO L93 Difference]: Finished difference Result 11340 states and 41524 transitions. [2024-11-02 12:26:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:26:04,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-11-02 12:26:04,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:04,979 INFO L225 Difference]: With dead ends: 11340 [2024-11-02 12:26:04,979 INFO L226 Difference]: Without dead ends: 7513 [2024-11-02 12:26:04,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:05,000 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:05,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2024-11-02 12:26:05,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7513. [2024-11-02 12:26:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7513 states, 7511 states have (on average 3.5414725069897486) internal successors, (26600), 7512 states have internal predecessors, (26600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:05,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 26600 transitions. [2024-11-02 12:26:05,543 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 26600 transitions. Word has length 4 [2024-11-02 12:26:05,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:05,544 INFO L471 AbstractCegarLoop]: Abstraction has 7513 states and 26600 transitions. [2024-11-02 12:26:05,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:05,545 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 26600 transitions. [2024-11-02 12:26:05,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 12:26:05,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:05,553 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:05,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:26:05,554 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:05,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:05,555 INFO L85 PathProgramCache]: Analyzing trace with hash -2126521112, now seen corresponding path program 1 times [2024-11-02 12:26:05,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:05,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965594640] [2024-11-02 12:26:05,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:05,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:05,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:05,672 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:05,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965594640] [2024-11-02 12:26:05,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965594640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:05,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:05,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:26:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380402429] [2024-11-02 12:26:05,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:05,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:26:05,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:05,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:26:05,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:05,678 INFO L87 Difference]: Start difference. First operand 7513 states and 26600 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:05,947 INFO L93 Difference]: Finished difference Result 7513 states and 26600 transitions. [2024-11-02 12:26:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:26:05,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-02 12:26:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:06,022 INFO L225 Difference]: With dead ends: 7513 [2024-11-02 12:26:06,022 INFO L226 Difference]: Without dead ends: 5812 [2024-11-02 12:26:06,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:06,030 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19 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-02 12:26:06,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:06,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5812 states. [2024-11-02 12:26:06,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5812 to 5812. [2024-11-02 12:26:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5812 states, 5811 states have (on average 3.513508862502151) internal successors, (20417), 5811 states have internal predecessors, (20417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5812 states to 5812 states and 20417 transitions. [2024-11-02 12:26:06,398 INFO L78 Accepts]: Start accepts. Automaton has 5812 states and 20417 transitions. Word has length 15 [2024-11-02 12:26:06,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:06,399 INFO L471 AbstractCegarLoop]: Abstraction has 5812 states and 20417 transitions. [2024-11-02 12:26:06,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:06,399 INFO L276 IsEmpty]: Start isEmpty. Operand 5812 states and 20417 transitions. [2024-11-02 12:26:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 12:26:06,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:06,404 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:06,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 12:26:06,405 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:06,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:06,406 INFO L85 PathProgramCache]: Analyzing trace with hash -2126519563, now seen corresponding path program 1 times [2024-11-02 12:26:06,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:06,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158407774] [2024-11-02 12:26:06,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:06,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:06,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:06,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158407774] [2024-11-02 12:26:06,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158407774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:06,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:06,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:26:06,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580350979] [2024-11-02 12:26:06,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:06,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:26:06,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:06,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:26:06,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:06,910 INFO L87 Difference]: Start difference. First operand 5812 states and 20417 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:07,534 INFO L93 Difference]: Finished difference Result 8407 states and 29243 transitions. [2024-11-02 12:26:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:26:07,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-02 12:26:07,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:07,598 INFO L225 Difference]: With dead ends: 8407 [2024-11-02 12:26:07,598 INFO L226 Difference]: Without dead ends: 5572 [2024-11-02 12:26:07,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-02 12:26:07,613 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 78 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:07,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 126 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 12:26:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5572 states. [2024-11-02 12:26:07,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5572 to 5572. [2024-11-02 12:26:07,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5572 states, 5571 states have (on average 3.4925507090288996) internal successors, (19457), 5571 states have internal predecessors, (19457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5572 states to 5572 states and 19457 transitions. [2024-11-02 12:26:07,972 INFO L78 Accepts]: Start accepts. Automaton has 5572 states and 19457 transitions. Word has length 15 [2024-11-02 12:26:07,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:07,973 INFO L471 AbstractCegarLoop]: Abstraction has 5572 states and 19457 transitions. [2024-11-02 12:26:07,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 5572 states and 19457 transitions. [2024-11-02 12:26:07,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-02 12:26:07,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:07,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:07,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 12:26:07,981 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:07,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:07,983 INFO L85 PathProgramCache]: Analyzing trace with hash 236870441, now seen corresponding path program 1 times [2024-11-02 12:26:07,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:07,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989409689] [2024-11-02 12:26:07,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:07,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:08,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:08,317 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989409689] [2024-11-02 12:26:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989409689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:08,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:08,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:26:08,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774581026] [2024-11-02 12:26:08,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:08,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:26:08,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:08,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:26:08,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:26:08,320 INFO L87 Difference]: Start difference. First operand 5572 states and 19457 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:08,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:08,871 INFO L93 Difference]: Finished difference Result 6847 states and 23647 transitions. [2024-11-02 12:26:08,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:26:08,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-02 12:26:08,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:08,924 INFO L225 Difference]: With dead ends: 6847 [2024-11-02 12:26:08,924 INFO L226 Difference]: Without dead ends: 4552 [2024-11-02 12:26:08,934 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-02 12:26:08,935 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 92 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:08,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 150 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-02 12:26:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4552 states. [2024-11-02 12:26:09,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4552 to 4552. [2024-11-02 12:26:09,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4552 states, 4551 states have (on average 3.4491320588881567) internal successors, (15697), 4551 states have internal predecessors, (15697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4552 states to 4552 states and 15697 transitions. [2024-11-02 12:26:09,114 INFO L78 Accepts]: Start accepts. Automaton has 4552 states and 15697 transitions. Word has length 18 [2024-11-02 12:26:09,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:09,115 INFO L471 AbstractCegarLoop]: Abstraction has 4552 states and 15697 transitions. [2024-11-02 12:26:09,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:09,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4552 states and 15697 transitions. [2024-11-02 12:26:09,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-02 12:26:09,121 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:09,122 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:09,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 12:26:09,122 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:09,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:09,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1932900873, now seen corresponding path program 1 times [2024-11-02 12:26:09,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:09,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762621735] [2024-11-02 12:26:09,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:09,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:09,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:09,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762621735] [2024-11-02 12:26:09,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762621735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:09,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:09,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:26:09,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692209535] [2024-11-02 12:26:09,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:09,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:26:09,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:09,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:26:09,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:26:09,536 INFO L87 Difference]: Start difference. First operand 4552 states and 15697 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:09,995 INFO L93 Difference]: Finished difference Result 5427 states and 18547 transitions. [2024-11-02 12:26:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-02 12:26:09,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-02 12:26:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:10,036 INFO L225 Difference]: With dead ends: 5427 [2024-11-02 12:26:10,036 INFO L226 Difference]: Without dead ends: 3852 [2024-11-02 12:26:10,043 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-02 12:26:10,044 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:10,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 124 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-02 12:26:10,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3852 states. [2024-11-02 12:26:10,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3852 to 3852. [2024-11-02 12:26:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3852 states, 3851 states have (on average 3.411321734614386) internal successors, (13137), 3851 states have internal predecessors, (13137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:10,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3852 states to 3852 states and 13137 transitions. [2024-11-02 12:26:10,220 INFO L78 Accepts]: Start accepts. Automaton has 3852 states and 13137 transitions. Word has length 19 [2024-11-02 12:26:10,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:10,221 INFO L471 AbstractCegarLoop]: Abstraction has 3852 states and 13137 transitions. [2024-11-02 12:26:10,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 3852 states and 13137 transitions. [2024-11-02 12:26:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-02 12:26:10,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:10,233 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-02 12:26:10,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 12:26:10,233 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:10,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:10,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1224149685, now seen corresponding path program 1 times [2024-11-02 12:26:10,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:10,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193609339] [2024-11-02 12:26:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:10,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:10,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:10,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193609339] [2024-11-02 12:26:10,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193609339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:10,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:10,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:26:10,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872645313] [2024-11-02 12:26:10,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:10,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:26:10,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:10,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:26:10,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:26:10,476 INFO L87 Difference]: Start difference. First operand 3852 states and 13137 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-02 12:26:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:10,647 INFO L93 Difference]: Finished difference Result 5468 states and 18183 transitions. [2024-11-02 12:26:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:26:10,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-02 12:26:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:10,671 INFO L225 Difference]: With dead ends: 5468 [2024-11-02 12:26:10,671 INFO L226 Difference]: Without dead ends: 2892 [2024-11-02 12:26:10,677 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:10,678 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 65 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 45 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-02 12:26:10,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 45 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:10,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2024-11-02 12:26:10,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2892. [2024-11-02 12:26:10,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2892 states, 2891 states have (on average 3.215842269111034) internal successors, (9297), 2891 states have internal predecessors, (9297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:10,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2892 states to 2892 states and 9297 transitions. [2024-11-02 12:26:10,768 INFO L78 Accepts]: Start accepts. Automaton has 2892 states and 9297 transitions. Word has length 23 [2024-11-02 12:26:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:10,768 INFO L471 AbstractCegarLoop]: Abstraction has 2892 states and 9297 transitions. [2024-11-02 12:26:10,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 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-02 12:26:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 2892 states and 9297 transitions. [2024-11-02 12:26:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-02 12:26:10,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:10,775 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-02 12:26:10,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 12:26:10,776 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:10,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:10,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2019070878, now seen corresponding path program 1 times [2024-11-02 12:26:10,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:10,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515003335] [2024-11-02 12:26:10,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:10,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:10,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:10,977 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:10,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515003335] [2024-11-02 12:26:10,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515003335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:10,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:10,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:26:10,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258207170] [2024-11-02 12:26:10,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:10,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:26:10,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:10,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:26:10,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:26:10,980 INFO L87 Difference]: Start difference. First operand 2892 states and 9297 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-02 12:26:11,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:11,188 INFO L93 Difference]: Finished difference Result 3404 states and 10717 transitions. [2024-11-02 12:26:11,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:26:11,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-02 12:26:11,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:11,213 INFO L225 Difference]: With dead ends: 3404 [2024-11-02 12:26:11,214 INFO L226 Difference]: Without dead ends: 1788 [2024-11-02 12:26:11,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:26:11,222 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 112 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 59 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-02 12:26:11,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 59 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:26:11,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2024-11-02 12:26:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1788. [2024-11-02 12:26:11,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1788 states, 1787 states have (on average 3.0402909904868496) internal successors, (5433), 1787 states have internal predecessors, (5433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1788 states to 1788 states and 5433 transitions. [2024-11-02 12:26:11,311 INFO L78 Accepts]: Start accepts. Automaton has 1788 states and 5433 transitions. Word has length 26 [2024-11-02 12:26:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:11,312 INFO L471 AbstractCegarLoop]: Abstraction has 1788 states and 5433 transitions. [2024-11-02 12:26:11,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 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-02 12:26:11,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1788 states and 5433 transitions. [2024-11-02 12:26:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-02 12:26:11,319 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:11,319 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] [2024-11-02 12:26:11,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 12:26:11,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:11,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:11,320 INFO L85 PathProgramCache]: Analyzing trace with hash 189840245, now seen corresponding path program 1 times [2024-11-02 12:26:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:11,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603352808] [2024-11-02 12:26:11,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:11,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:11,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:11,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:11,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603352808] [2024-11-02 12:26:11,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603352808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:11,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:11,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:26:11,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94034824] [2024-11-02 12:26:11,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:11,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:26:11,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:11,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:26:11,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:26:11,857 INFO L87 Difference]: Start difference. First operand 1788 states and 5433 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:12,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:12,079 INFO L93 Difference]: Finished difference Result 1852 states and 5585 transitions. [2024-11-02 12:26:12,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:26:12,080 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-02 12:26:12,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:12,100 INFO L225 Difference]: With dead ends: 1852 [2024-11-02 12:26:12,101 INFO L226 Difference]: Without dead ends: 1340 [2024-11-02 12:26:12,103 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:26:12,104 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 132 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:12,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 48 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:26:12,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2024-11-02 12:26:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2024-11-02 12:26:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1340 states, 1339 states have (on average 3.0537714712471993) internal successors, (4089), 1339 states have internal predecessors, (4089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4089 transitions. [2024-11-02 12:26:12,167 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4089 transitions. Word has length 29 [2024-11-02 12:26:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:12,169 INFO L471 AbstractCegarLoop]: Abstraction has 1340 states and 4089 transitions. [2024-11-02 12:26:12,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:12,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4089 transitions. [2024-11-02 12:26:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-02 12:26:12,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:12,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:12,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 12:26:12,176 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:12,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:12,177 INFO L85 PathProgramCache]: Analyzing trace with hash 268414096, now seen corresponding path program 1 times [2024-11-02 12:26:12,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:12,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967145609] [2024-11-02 12:26:12,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:12,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:12,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:12,814 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:12,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967145609] [2024-11-02 12:26:12,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967145609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:12,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:12,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-02 12:26:12,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128240347] [2024-11-02 12:26:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:12,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:26:12,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:12,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:26:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:26:12,818 INFO L87 Difference]: Start difference. First operand 1340 states and 4089 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:13,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:13,092 INFO L93 Difference]: Finished difference Result 1964 states and 5905 transitions. [2024-11-02 12:26:13,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:26:13,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-02 12:26:13,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:13,110 INFO L225 Difference]: With dead ends: 1964 [2024-11-02 12:26:13,110 INFO L226 Difference]: Without dead ends: 920 [2024-11-02 12:26:13,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-02 12:26:13,114 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 49 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:13,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 130 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:26:13,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2024-11-02 12:26:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 920. [2024-11-02 12:26:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 919 states have (on average 2.9183895538628946) internal successors, (2682), 919 states have internal predecessors, (2682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:13,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 2682 transitions. [2024-11-02 12:26:13,164 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 2682 transitions. Word has length 34 [2024-11-02 12:26:13,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:13,164 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 2682 transitions. [2024-11-02 12:26:13,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:13,165 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 2682 transitions. [2024-11-02 12:26:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-02 12:26:13,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:13,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:13,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 12:26:13,170 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:13,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:13,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1806181862, now seen corresponding path program 2 times [2024-11-02 12:26:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:13,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746525999] [2024-11-02 12:26:13,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:13,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:13,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:13,642 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:26:13,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746525999] [2024-11-02 12:26:13,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746525999] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:13,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:13,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-02 12:26:13,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394546211] [2024-11-02 12:26:13,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:13,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-02 12:26:13,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:26:13,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-02 12:26:13,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-02 12:26:13,644 INFO L87 Difference]: Start difference. First operand 920 states and 2682 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:13,987 INFO L93 Difference]: Finished difference Result 1208 states and 3482 transitions. [2024-11-02 12:26:13,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-02 12:26:13,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-02 12:26:13,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:14,000 INFO L225 Difference]: With dead ends: 1208 [2024-11-02 12:26:14,001 INFO L226 Difference]: Without dead ends: 556 [2024-11-02 12:26:14,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-02 12:26:14,003 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 66 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:14,004 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 138 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:26:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-11-02 12:26:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2024-11-02 12:26:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 555 states have (on average 2.7387387387387387) internal successors, (1520), 555 states have internal predecessors, (1520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 1520 transitions. [2024-11-02 12:26:14,029 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 1520 transitions. Word has length 34 [2024-11-02 12:26:14,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:14,029 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 1520 transitions. [2024-11-02 12:26:14,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:14,029 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 1520 transitions. [2024-11-02 12:26:14,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-02 12:26:14,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:14,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:14,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 12:26:14,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:14,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:14,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2131222686, now seen corresponding path program 3 times [2024-11-02 12:26:14,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:26:14,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069261700] [2024-11-02 12:26:14,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:14,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:26:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:26:14,158 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 12:26:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:26:14,328 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-02 12:26:14,328 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 12:26:14,329 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (6 of 7 remaining) [2024-11-02 12:26:14,331 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (5 of 7 remaining) [2024-11-02 12:26:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (4 of 7 remaining) [2024-11-02 12:26:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2024-11-02 12:26:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2024-11-02 12:26:14,332 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2024-11-02 12:26:14,333 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 7 remaining) [2024-11-02 12:26:14,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 12:26:14,336 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:14,460 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-02 12:26:14,460 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 12:26:14,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:26:14 BasicIcfg [2024-11-02 12:26:14,464 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 12:26:14,464 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 12:26:14,465 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 12:26:14,465 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 12:26:14,466 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:26:02" (3/4) ... [2024-11-02 12:26:14,468 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-02 12:26:14,469 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 12:26:14,470 INFO L158 Benchmark]: Toolchain (without parser) took 13707.83ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 114.6MB in the beginning and 736.4MB in the end (delta: -621.8MB). Peak memory consumption was 266.1MB. Max. memory is 16.1GB. [2024-11-02 12:26:14,470 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 116.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 12:26:14,471 INFO L158 Benchmark]: CACSL2BoogieTranslator took 805.74ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 88.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-02 12:26:14,471 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.57ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 12:26:14,471 INFO L158 Benchmark]: Boogie Preprocessor took 43.34ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 83.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 12:26:14,472 INFO L158 Benchmark]: RCFGBuilder took 1173.07ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 99.6MB in the end (delta: -15.9MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. [2024-11-02 12:26:14,472 INFO L158 Benchmark]: TraceAbstraction took 11593.91ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 98.8MB in the beginning and 736.4MB in the end (delta: -637.6MB). Peak memory consumption was 249.3MB. Max. memory is 16.1GB. [2024-11-02 12:26:14,472 INFO L158 Benchmark]: Witness Printer took 4.95ms. Allocated memory is still 1.0GB. Free memory is still 736.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 12:26:14,474 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.31ms. Allocated memory is still 142.6MB. Free memory was 116.9MB in the beginning and 116.7MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 805.74ms. Allocated memory is still 142.6MB. Free memory was 114.3MB in the beginning and 88.5MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.57ms. Allocated memory is still 142.6MB. Free memory was 87.9MB in the beginning and 85.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.34ms. Allocated memory is still 142.6MB. Free memory was 85.6MB in the beginning and 83.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1173.07ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 99.6MB in the end (delta: -15.9MB). Peak memory consumption was 48.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11593.91ms. Allocated memory was 142.6MB in the beginning and 1.0GB in the end (delta: 887.1MB). Free memory was 98.8MB in the beginning and 736.4MB in the end (delta: -637.6MB). Peak memory consumption was 249.3MB. Max. memory is 16.1GB. * Witness Printer took 4.95ms. Allocated memory is still 1.0GB. Free memory is still 736.4MB. 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_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 0; [L724] 0 _Bool b$flush_delayed; [L725] 0 int b$mem_tmp; [L726] 0 _Bool b$r_buff0_thd0; [L727] 0 _Bool b$r_buff0_thd1; [L728] 0 _Bool b$r_buff0_thd2; [L729] 0 _Bool b$r_buff0_thd3; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$read_delayed; [L735] 0 int *b$read_delayed_var; [L736] 0 int b$w_buff0; [L737] 0 _Bool b$w_buff0_used; [L738] 0 int b$w_buff1; [L739] 0 _Bool b$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t849; [L856] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-3, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t850; [L858] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-3, t850=-2, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t851; [L860] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t849=-3, t850=-2, t851=-1, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 b$w_buff1 = b$w_buff0 [L754] 1 b$w_buff0 = 1 [L755] 1 b$w_buff1_used = b$w_buff0_used [L756] 1 b$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L758] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L759] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L760] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L761] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 __unbuffered_p0_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L782] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L785] 2 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L788] 2 __unbuffered_p1_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EBX = z VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L795] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L796] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L797] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L798] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L808] 3 z = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L811] 3 a = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = a VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 b$flush_delayed = weak$$choice2 [L820] 3 b$mem_tmp = b [L821] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L822] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L823] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L824] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L825] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 b$r_buff0_thd3 = weak$$choice2 ? b$r_buff0_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff0_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3)) [L827] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = b [L829] 3 b = b$flush_delayed ? b$mem_tmp : b [L830] 3 b$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L834] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L835] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L836] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L837] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-3, t850=-2, t851=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L867] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L868] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L869] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L870] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-3, t850=-2, t851=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t849=-3, t850=-2, t851=-1, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L875] 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_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L17] 0 __assert_fail ("0", "mix032.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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: 853]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: 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: 858]: 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: 856]: 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, 76 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 4.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 723 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 723 mSDsluCounter, 878 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 608 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1074 IncrementalHoareTripleChecker+Invalid, 1088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 270 mSDtfsCounter, 1074 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9477occurred in iteration=0, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 251 NumberOfCodeBlocks, 251 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-02 12:26:14,518 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/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/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2 --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:26:17,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:26:17,413 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2024-11-02 12:26:17,425 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:26:17,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:26:17,463 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:26:17,464 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:26:17,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:26:17,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:26:17,468 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:26:17,469 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:26:17,469 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:26:17,469 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:26:17,473 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:26:17,473 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:26:17,474 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:26:17,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 12:26:17,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 12:26:17,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:26:17,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-02 12:26:17,477 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:26:17,477 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-02 12:26:17,477 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:26:17,478 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 12:26:17,478 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 12:26:17,478 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 12:26:17,478 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:26:17,479 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 12:26:17,479 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-02 12:26:17,479 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:26:17,480 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-02 12:26:17,481 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 12:26:17,481 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-02 12:26:17,482 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:26:17,482 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:26:17,483 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-02 12:26:17,483 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:26:17,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:26:17,484 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:26:17,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:26:17,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:26:17,485 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2024-11-02 12:26:17,486 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-02 12:26:17,486 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:26:17,486 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:26:17,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:26:17,487 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f271a38be9caac1825a663eb11850ec78cc50bf41fe675769961ef9ec85f6a9e [2024-11-02 12:26:17,950 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:26:17,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:26:17,989 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:26:17,990 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:26:17,991 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:26:17,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/pthread-wmm/mix032.oepc.i Unable to find full path for "g++" [2024-11-02 12:26:20,246 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:26:20,566 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:26:20,566 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/sv-benchmarks/c/pthread-wmm/mix032.oepc.i [2024-11-02 12:26:20,595 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/data/33407a202/5e0a056f9a62413fa782112c25ab0bf9/FLAG9341bfe9a [2024-11-02 12:26:20,618 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/data/33407a202/5e0a056f9a62413fa782112c25ab0bf9 [2024-11-02 12:26:20,620 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:26:20,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:26:20,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:26:20,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:26:20,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:26:20,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:26:20" (1/1) ... [2024-11-02 12:26:20,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cf58921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:20, skipping insertion in model container [2024-11-02 12:26:20,634 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:26:20" (1/1) ... [2024-11-02 12:26:20,683 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:26:21,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:26:21,233 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:26:21,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:26:21,388 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:26:21,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21 WrapperNode [2024-11-02 12:26:21,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:26:21,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:26:21,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:26:21,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:26:21,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,428 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,474 INFO L138 Inliner]: procedures = 176, calls = 51, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 125 [2024-11-02 12:26:21,474 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:26:21,475 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:26:21,478 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:26:21,478 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:26:21,490 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,517 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,526 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,527 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:26:21,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:26:21,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:26:21,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:26:21,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (1/1) ... [2024-11-02 12:26:21,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:26:21,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:26:21,587 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:26:21,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:26:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-02 12:26:21,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-02 12:26:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-11-02 12:26:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-02 12:26:21,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-02 12:26:21,624 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-02 12:26:21,624 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-02 12:26:21,625 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-02 12:26:21,626 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-02 12:26:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-02 12:26:21,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:26:21,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:26:21,629 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-02 12:26:21,825 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:26:21,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:26:22,326 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-02 12:26:22,327 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:26:22,664 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:26:22,666 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-02 12:26:22,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:26:22 BoogieIcfgContainer [2024-11-02 12:26:22,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:26:22,670 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:26:22,671 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:26:22,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:26:22,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:26:20" (1/3) ... [2024-11-02 12:26:22,676 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd63db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:26:22, skipping insertion in model container [2024-11-02 12:26:22,677 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:26:21" (2/3) ... [2024-11-02 12:26:22,677 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd63db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:26:22, skipping insertion in model container [2024-11-02 12:26:22,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:26:22" (3/3) ... [2024-11-02 12:26:22,679 INFO L112 eAbstractionObserver]: Analyzing ICFG mix032.oepc.i [2024-11-02 12:26:22,703 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:26:22,703 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-02 12:26:22,703 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-02 12:26:22,781 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-02 12:26:22,815 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 56 places, 48 transitions, 108 flow [2024-11-02 12:26:23,438 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 9477 states, 9472 states have (on average 3.7006967905405403) internal successors, (35053), 9476 states have internal predecessors, (35053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:23,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:26:23,485 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;@13202fc0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:26:23,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-02 12:26:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand has 9477 states, 9472 states have (on average 3.7006967905405403) internal successors, (35053), 9476 states have internal predecessors, (35053), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:23,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-02 12:26:23,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:23,538 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-02 12:26:23,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:23,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:23,545 INFO L85 PathProgramCache]: Analyzing trace with hash 12558048, now seen corresponding path program 1 times [2024-11-02 12:26:23,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-02 12:26:23,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1883589921] [2024-11-02 12:26:23,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:23,561 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-02 12:26:23,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/mathsat [2024-11-02 12:26:23,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/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-02 12:26:23,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/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-02 12:26:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:23,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-02 12:26:23,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:26:23,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:23,755 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 12:26:23,756 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-02 12:26:23,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1883589921] [2024-11-02 12:26:23,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1883589921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:23,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:23,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:26:23,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83470106] [2024-11-02 12:26:23,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:23,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:26:23,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-02 12:26:23,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:26:23,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:23,828 INFO L87 Difference]: Start difference. First operand has 9477 states, 9472 states have (on average 3.7006967905405403) internal successors, (35053), 9476 states have internal predecessors, (35053), 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 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:24,254 INFO L93 Difference]: Finished difference Result 11340 states and 41524 transitions. [2024-11-02 12:26:24,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:26:24,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2024-11-02 12:26:24,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:24,431 INFO L225 Difference]: With dead ends: 11340 [2024-11-02 12:26:24,431 INFO L226 Difference]: Without dead ends: 7513 [2024-11-02 12:26:24,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:26:24,451 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:26:24,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 39 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:26:24,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7513 states. [2024-11-02 12:26:25,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7513 to 7513. [2024-11-02 12:26:25,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7513 states, 7511 states have (on average 3.5414725069897486) internal successors, (26600), 7512 states have internal predecessors, (26600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7513 states to 7513 states and 26600 transitions. [2024-11-02 12:26:25,337 INFO L78 Accepts]: Start accepts. Automaton has 7513 states and 26600 transitions. Word has length 4 [2024-11-02 12:26:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:25,339 INFO L471 AbstractCegarLoop]: Abstraction has 7513 states and 26600 transitions. [2024-11-02 12:26:25,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 7513 states and 26600 transitions. [2024-11-02 12:26:25,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-02 12:26:25,351 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:25,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:26:25,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/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-02 12:26:25,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/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-02 12:26:25,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 4 more)] === [2024-11-02 12:26:25,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:26:25,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1561748266, now seen corresponding path program 1 times [2024-11-02 12:26:25,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2024-11-02 12:26:25,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449343119] [2024-11-02 12:26:25,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:26:25,559 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-02 12:26:25,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/mathsat [2024-11-02 12:26:25,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/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-02 12:26:25,571 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/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-02 12:26:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:26:25,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-02 12:26:25,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:26:25,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:26:25,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-02 12:26:25,786 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2024-11-02 12:26:25,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449343119] [2024-11-02 12:26:25,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449343119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:26:25,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:26:25,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:26:25,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227751412] [2024-11-02 12:26:25,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:26:25,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:26:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2024-11-02 12:26:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:26:25,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:26:25,790 INFO L87 Difference]: Start difference. First operand 7513 states and 26600 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-02 12:26:26,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:26:26,146 INFO L93 Difference]: Finished difference Result 11055 states and 38169 transitions. [2024-11-02 12:26:26,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:26:26,147 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-02 12:26:26,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:26:26,274 INFO L225 Difference]: With dead ends: 11055 [2024-11-02 12:26:26,274 INFO L226 Difference]: Without dead ends: 4818 [2024-11-02 12:26:26,287 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-02 12:26:26,289 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 51 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-02 12:26:26,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 51 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:26:26,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4818 states. [2024-11-02 12:26:26,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4818 to 4818. [2024-11-02 12:26:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4818 states, 4816 states have (on average 3.2848837209302326) internal successors, (15820), 4817 states have internal predecessors, (15820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:26:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4818 states to 4818 states and 15820 transitions. [2024-11-02 12:26:26,639 INFO L78 Accepts]: Start accepts. Automaton has 4818 states and 15820 transitions. Word has length 15 [2024-11-02 12:26:26,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:26:26,641 INFO L471 AbstractCegarLoop]: Abstraction has 4818 states and 15820 transitions. [2024-11-02 12:26:26,641 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-02 12:26:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 4818 states and 15820 transitions. [2024-11-02 12:26:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-02 12:26:26,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:26:26,652 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-02 12:26:26,657 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fc182d37-2671-410c-a26c-c7b18c990348/bin/utaipan-verify-DbMuA5NWw2/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