./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4e7fbc69 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_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 15:42:06,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:42:06,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:42:06,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:42:06,128 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:42:06,132 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:42:06,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:42:06,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:42:06,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:42:06,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:42:06,147 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:42:06,148 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:42:06,149 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:42:06,151 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:42:06,153 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:42:06,155 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:42:06,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:42:06,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:42:06,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:42:06,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:42:06,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:42:06,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:42:06,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:42:06,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:42:06,180 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:42:06,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:42:06,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:42:06,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:42:06,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:42:06,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:42:06,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:42:06,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:42:06,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:42:06,186 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:42:06,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:42:06,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:42:06,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:42:06,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:42:06,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:42:06,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:42:06,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:42:06,195 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-23 15:42:06,238 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:42:06,239 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:42:06,239 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:42:06,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:42:06,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:42:06,241 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:42:06,241 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:42:06,241 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:42:06,241 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:42:06,242 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:42:06,243 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:42:06,243 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:42:06,243 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:42:06,243 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:42:06,244 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:42:06,244 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:42:06,244 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:42:06,244 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:42:06,245 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:42:06,246 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:42:06,246 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:42:06,246 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:42:06,246 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:42:06,247 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:42:06,247 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:42:06,247 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:42:06,247 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:42:06,248 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:42:06,248 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 15:42:06,248 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:42:06,248 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:42:06,249 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:42:06,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:42:06,249 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:42:06,249 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:42:06,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:42:06,250 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:42:06,250 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:42:06,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:42:06,251 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:42:06,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:42:06,251 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:42:06,251 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 [2022-11-23 15:42:06,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:42:06,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:42:06,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:42:06,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:42:06,536 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:42:06,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-11-23 15:42:09,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:42:09,902 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:42:09,902 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-11-23 15:42:09,941 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/data/8ac5b2fc5/ba18886dd2ef4bed8ad5cc0c527e3568/FLAG258b9f3a3 [2022-11-23 15:42:09,959 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/data/8ac5b2fc5/ba18886dd2ef4bed8ad5cc0c527e3568 [2022-11-23 15:42:09,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:42:09,966 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:42:09,967 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:42:09,967 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:42:09,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:42:09,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:42:09" (1/1) ... [2022-11-23 15:42:09,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab02a9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:09, skipping insertion in model container [2022-11-23 15:42:09,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:42:09" (1/1) ... [2022-11-23 15:42:09,983 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:42:10,050 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:42:10,222 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-11-23 15:42:10,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:42:10,521 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:42:10,531 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-11-23 15:42:10,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:42:10,661 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:42:10,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10 WrapperNode [2022-11-23 15:42:10,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:42:10,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:42:10,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:42:10,665 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:42:10,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,743 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2022-11-23 15:42:10,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:42:10,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:42:10,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:42:10,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:42:10,755 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,755 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,770 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,772 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:42:10,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:42:10,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:42:10,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:42:10,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (1/1) ... [2022-11-23 15:42:10,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:42:10,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:42:10,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:42:10,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:42:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 15:42:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 15:42:10,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:42:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:42:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:42:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 15:42:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 15:42:10,895 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 15:42:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 15:42:10,896 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 15:42:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 15:42:10,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:42:10,896 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 15:42:10,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:42:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:42:10,898 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:42:11,144 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:42:11,147 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:42:11,502 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:42:11,680 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:42:11,680 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:42:11,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:11 BoogieIcfgContainer [2022-11-23 15:42:11,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:42:11,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:42:11,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:42:11,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:42:11,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:42:09" (1/3) ... [2022-11-23 15:42:11,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea57b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:42:11, skipping insertion in model container [2022-11-23 15:42:11,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:10" (2/3) ... [2022-11-23 15:42:11,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea57b45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:42:11, skipping insertion in model container [2022-11-23 15:42:11,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:11" (3/3) ... [2022-11-23 15:42:11,702 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2022-11-23 15:42:11,724 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:42:11,724 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-23 15:42:11,724 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:42:11,798 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 15:42:11,834 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:42:11,859 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-23 15:42:11,871 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 130 transitions, 275 flow [2022-11-23 15:42:11,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 130 transitions, 275 flow [2022-11-23 15:42:11,947 INFO L130 PetriNetUnfolder]: 2/127 cut-off events. [2022-11-23 15:42:11,947 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 15:42:11,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137 conditions, 127 events. 2/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/116 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-23 15:42:11,960 INFO L119 LiptonReduction]: Number of co-enabled transitions 2544 [2022-11-23 15:42:17,754 INFO L134 LiptonReduction]: Checked pairs total: 6739 [2022-11-23 15:42:17,754 INFO L136 LiptonReduction]: Total number of compositions: 125 [2022-11-23 15:42:17,763 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 87 flow [2022-11-23 15:42:17,884 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1284 states, 1271 states have (on average 3.373721479150275) internal successors, (4288), 1283 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:17,900 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:42:17,906 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@72a0403c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:42:17,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-23 15:42:17,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 1284 states, 1271 states have (on average 3.373721479150275) internal successors, (4288), 1283 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:17,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:42:17,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:17,933 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:42:17,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:17,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:17,939 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 1 times [2022-11-23 15:42:17,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:17,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959842284] [2022-11-23 15:42:17,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:17,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:18,064 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:18,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959842284] [2022-11-23 15:42:18,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959842284] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:18,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:18,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:42:18,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320185202] [2022-11-23 15:42:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:18,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:42:18,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:18,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:42:18,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:42:18,099 INFO L87 Difference]: Start difference. First operand has 1284 states, 1271 states have (on average 3.373721479150275) internal successors, (4288), 1283 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:18,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:18,192 INFO L93 Difference]: Finished difference Result 1212 states and 3930 transitions. [2022-11-23 15:42:18,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:42:18,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-23 15:42:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:18,219 INFO L225 Difference]: With dead ends: 1212 [2022-11-23 15:42:18,219 INFO L226 Difference]: Without dead ends: 1212 [2022-11-23 15:42:18,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:42:18,223 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:18,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-23 15:42:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2022-11-23 15:42:18,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2022-11-23 15:42:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1207 states have (on average 3.256006628003314) internal successors, (3930), 1211 states have internal predecessors, (3930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:18,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 3930 transitions. [2022-11-23 15:42:18,329 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 3930 transitions. Word has length 1 [2022-11-23 15:42:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:18,329 INFO L495 AbstractCegarLoop]: Abstraction has 1212 states and 3930 transitions. [2022-11-23 15:42:18,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 3930 transitions. [2022-11-23 15:42:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 15:42:18,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:18,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 15:42:18,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:42:18,331 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:18,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:18,332 INFO L85 PathProgramCache]: Analyzing trace with hash 517240881, now seen corresponding path program 1 times [2022-11-23 15:42:18,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:18,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849428673] [2022-11-23 15:42:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:18,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:18,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:18,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:18,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:18,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849428673] [2022-11-23 15:42:18,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849428673] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:18,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:18,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:42:18,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959378968] [2022-11-23 15:42:18,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:18,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:42:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:18,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:42:18,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:42:18,714 INFO L87 Difference]: Start difference. First operand 1212 states and 3930 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:18,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:18,808 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2022-11-23 15:42:18,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:42:18,809 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-23 15:42:18,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:18,815 INFO L225 Difference]: With dead ends: 992 [2022-11-23 15:42:18,815 INFO L226 Difference]: Without dead ends: 962 [2022-11-23 15:42:18,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:42:18,821 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:18,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:18,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-23 15:42:18,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-11-23 15:42:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:18,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2022-11-23 15:42:18,864 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 5 [2022-11-23 15:42:18,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:18,864 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2022-11-23 15:42:18,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:18,865 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2022-11-23 15:42:18,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:42:18,867 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:18,867 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:18,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:42:18,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:18,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:18,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1655053618, now seen corresponding path program 1 times [2022-11-23 15:42:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:18,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110820034] [2022-11-23 15:42:18,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:18,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:19,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:19,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:19,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110820034] [2022-11-23 15:42:19,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110820034] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:19,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:19,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:42:19,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561783093] [2022-11-23 15:42:19,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:19,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:42:19,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:19,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:42:19,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:42:19,480 INFO L87 Difference]: Start difference. First operand 962 states and 3090 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:19,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:19,705 INFO L93 Difference]: Finished difference Result 1367 states and 4304 transitions. [2022-11-23 15:42:19,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:42:19,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-23 15:42:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:19,719 INFO L225 Difference]: With dead ends: 1367 [2022-11-23 15:42:19,719 INFO L226 Difference]: Without dead ends: 1367 [2022-11-23 15:42:19,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:42:19,721 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:19,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 18 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:42:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-11-23 15:42:19,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1277. [2022-11-23 15:42:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1277 states, 1275 states have (on average 3.2133333333333334) internal successors, (4097), 1276 states have internal predecessors, (4097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:19,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1277 states to 1277 states and 4097 transitions. [2022-11-23 15:42:19,771 INFO L78 Accepts]: Start accepts. Automaton has 1277 states and 4097 transitions. Word has length 10 [2022-11-23 15:42:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:19,774 INFO L495 AbstractCegarLoop]: Abstraction has 1277 states and 4097 transitions. [2022-11-23 15:42:19,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:19,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1277 states and 4097 transitions. [2022-11-23 15:42:19,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:42:19,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:19,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:19,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:42:19,778 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:19,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:19,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1655053638, now seen corresponding path program 1 times [2022-11-23 15:42:19,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:19,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788632135] [2022-11-23 15:42:19,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:20,000 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:20,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788632135] [2022-11-23 15:42:20,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788632135] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:20,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:20,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:42:20,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995326806] [2022-11-23 15:42:20,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:20,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:42:20,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:20,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:42:20,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:42:20,002 INFO L87 Difference]: Start difference. First operand 1277 states and 4097 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:20,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:20,198 INFO L93 Difference]: Finished difference Result 2418 states and 7353 transitions. [2022-11-23 15:42:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:42:20,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-23 15:42:20,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:20,212 INFO L225 Difference]: With dead ends: 2418 [2022-11-23 15:42:20,213 INFO L226 Difference]: Without dead ends: 2130 [2022-11-23 15:42:20,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:20,218 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 33 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:20,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 12 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:42:20,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2022-11-23 15:42:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1698. [2022-11-23 15:42:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1698 states, 1696 states have (on average 3.1580188679245285) internal successors, (5356), 1697 states have internal predecessors, (5356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:20,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1698 states to 1698 states and 5356 transitions. [2022-11-23 15:42:20,350 INFO L78 Accepts]: Start accepts. Automaton has 1698 states and 5356 transitions. Word has length 10 [2022-11-23 15:42:20,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:20,350 INFO L495 AbstractCegarLoop]: Abstraction has 1698 states and 5356 transitions. [2022-11-23 15:42:20,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1698 states and 5356 transitions. [2022-11-23 15:42:20,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 15:42:20,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:20,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:20,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:42:20,358 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:20,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:20,359 INFO L85 PathProgramCache]: Analyzing trace with hash 232323189, now seen corresponding path program 1 times [2022-11-23 15:42:20,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:20,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921730875] [2022-11-23 15:42:20,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:20,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:20,496 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:20,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921730875] [2022-11-23 15:42:20,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921730875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:20,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:20,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:42:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612154410] [2022-11-23 15:42:20,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:20,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:42:20,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:20,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:42:20,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:20,499 INFO L87 Difference]: Start difference. First operand 1698 states and 5356 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:20,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:20,726 INFO L93 Difference]: Finished difference Result 2140 states and 6458 transitions. [2022-11-23 15:42:20,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:42:20,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-23 15:42:20,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:20,740 INFO L225 Difference]: With dead ends: 2140 [2022-11-23 15:42:20,740 INFO L226 Difference]: Without dead ends: 1970 [2022-11-23 15:42:20,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:42:20,741 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 56 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:20,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 17 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:42:20,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1970 states. [2022-11-23 15:42:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1970 to 1508. [2022-11-23 15:42:20,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1506 states have (on average 3.1301460823373173) internal successors, (4714), 1507 states have internal predecessors, (4714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:20,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 4714 transitions. [2022-11-23 15:42:20,806 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 4714 transitions. Word has length 11 [2022-11-23 15:42:20,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:20,807 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 4714 transitions. [2022-11-23 15:42:20,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 4714 transitions. [2022-11-23 15:42:20,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:42:20,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:20,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:20,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:42:20,809 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:20,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:20,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1369320201, now seen corresponding path program 1 times [2022-11-23 15:42:20,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:20,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307138765] [2022-11-23 15:42:20,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:20,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:20,943 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:20,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307138765] [2022-11-23 15:42:20,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307138765] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:20,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:20,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:42:20,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567042637] [2022-11-23 15:42:20,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:20,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:42:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:20,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:42:20,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:20,945 INFO L87 Difference]: Start difference. First operand 1508 states and 4714 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:21,208 INFO L93 Difference]: Finished difference Result 2228 states and 6682 transitions. [2022-11-23 15:42:21,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:42:21,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 15:42:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:21,223 INFO L225 Difference]: With dead ends: 2228 [2022-11-23 15:42:21,223 INFO L226 Difference]: Without dead ends: 2087 [2022-11-23 15:42:21,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:42:21,224 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 49 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 16 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:42:21,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2022-11-23 15:42:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 1526. [2022-11-23 15:42:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1524 states have (on average 3.1286089238845145) internal successors, (4768), 1525 states have internal predecessors, (4768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 4768 transitions. [2022-11-23 15:42:21,306 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 4768 transitions. Word has length 12 [2022-11-23 15:42:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:21,307 INFO L495 AbstractCegarLoop]: Abstraction has 1526 states and 4768 transitions. [2022-11-23 15:42:21,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 4768 transitions. [2022-11-23 15:42:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:42:21,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:21,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:21,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:42:21,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:21,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1358584011, now seen corresponding path program 1 times [2022-11-23 15:42:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:21,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919886035] [2022-11-23 15:42:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:21,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:21,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:21,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:21,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919886035] [2022-11-23 15:42:21,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919886035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:21,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:21,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:42:21,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938778552] [2022-11-23 15:42:21,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:21,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:42:21,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:21,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:42:21,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:21,614 INFO L87 Difference]: Start difference. First operand 1526 states and 4768 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:21,741 INFO L93 Difference]: Finished difference Result 1436 states and 4387 transitions. [2022-11-23 15:42:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:42:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-23 15:42:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:21,748 INFO L225 Difference]: With dead ends: 1436 [2022-11-23 15:42:21,749 INFO L226 Difference]: Without dead ends: 1292 [2022-11-23 15:42:21,749 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:21,750 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 24 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:21,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 12 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:21,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2022-11-23 15:42:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 806. [2022-11-23 15:42:21,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 3.034782608695652) internal successors, (2443), 805 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2443 transitions. [2022-11-23 15:42:21,780 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 2443 transitions. Word has length 12 [2022-11-23 15:42:21,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:21,781 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 2443 transitions. [2022-11-23 15:42:21,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 2443 transitions. [2022-11-23 15:42:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 15:42:21,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:21,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:21,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:42:21,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash -76388366, now seen corresponding path program 1 times [2022-11-23 15:42:21,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:21,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346234684] [2022-11-23 15:42:21,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:21,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:21,926 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:21,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346234684] [2022-11-23 15:42:21,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346234684] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:21,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:21,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:42:21,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859087473] [2022-11-23 15:42:21,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:21,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:42:21,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:21,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:42:21,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:21,929 INFO L87 Difference]: Start difference. First operand 806 states and 2443 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:22,121 INFO L93 Difference]: Finished difference Result 1022 states and 2977 transitions. [2022-11-23 15:42:22,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:42:22,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-23 15:42:22,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:22,127 INFO L225 Difference]: With dead ends: 1022 [2022-11-23 15:42:22,127 INFO L226 Difference]: Without dead ends: 902 [2022-11-23 15:42:22,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:42:22,128 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 43 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:22,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 18 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:42:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2022-11-23 15:42:22,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 686. [2022-11-23 15:42:22,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 3.0291970802919708) internal successors, (2075), 685 states have internal predecessors, (2075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 2075 transitions. [2022-11-23 15:42:22,152 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 2075 transitions. Word has length 13 [2022-11-23 15:42:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:22,153 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 2075 transitions. [2022-11-23 15:42:22,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 2075 transitions. [2022-11-23 15:42:22,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:42:22,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:22,155 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:22,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 15:42:22,155 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:22,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:22,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1880817430, now seen corresponding path program 1 times [2022-11-23 15:42:22,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:22,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148267382] [2022-11-23 15:42:22,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:22,276 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:22,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148267382] [2022-11-23 15:42:22,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148267382] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:22,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:22,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:42:22,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708225525] [2022-11-23 15:42:22,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:22,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:42:22,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:22,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:42:22,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:42:22,279 INFO L87 Difference]: Start difference. First operand 686 states and 2075 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:22,336 INFO L93 Difference]: Finished difference Result 462 states and 1183 transitions. [2022-11-23 15:42:22,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:42:22,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 15:42:22,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:22,339 INFO L225 Difference]: With dead ends: 462 [2022-11-23 15:42:22,339 INFO L226 Difference]: Without dead ends: 462 [2022-11-23 15:42:22,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:42:22,341 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:22,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:22,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-11-23 15:42:22,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 462. [2022-11-23 15:42:22,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 461 states have (on average 2.5661605206073754) internal successors, (1183), 461 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 1183 transitions. [2022-11-23 15:42:22,354 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 1183 transitions. Word has length 14 [2022-11-23 15:42:22,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:22,354 INFO L495 AbstractCegarLoop]: Abstraction has 462 states and 1183 transitions. [2022-11-23 15:42:22,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,355 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 1183 transitions. [2022-11-23 15:42:22,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 15:42:22,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:22,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:22,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 15:42:22,356 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:22,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash -2086021050, now seen corresponding path program 1 times [2022-11-23 15:42:22,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:22,358 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292894766] [2022-11-23 15:42:22,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:22,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:22,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:22,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:22,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292894766] [2022-11-23 15:42:22,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292894766] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:22,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:22,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:42:22,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379514638] [2022-11-23 15:42:22,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:22,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:42:22,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:22,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:42:22,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:42:22,534 INFO L87 Difference]: Start difference. First operand 462 states and 1183 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:22,617 INFO L93 Difference]: Finished difference Result 282 states and 649 transitions. [2022-11-23 15:42:22,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:42:22,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 15:42:22,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:22,619 INFO L225 Difference]: With dead ends: 282 [2022-11-23 15:42:22,619 INFO L226 Difference]: Without dead ends: 282 [2022-11-23 15:42:22,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:42:22,620 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:22,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 9 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:22,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-23 15:42:22,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 279. [2022-11-23 15:42:22,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 2.305755395683453) internal successors, (641), 278 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 641 transitions. [2022-11-23 15:42:22,628 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 641 transitions. Word has length 16 [2022-11-23 15:42:22,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:22,628 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 641 transitions. [2022-11-23 15:42:22,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,629 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 641 transitions. [2022-11-23 15:42:22,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 15:42:22,629 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:22,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:22,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 15:42:22,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:22,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:22,630 INFO L85 PathProgramCache]: Analyzing trace with hash -579608879, now seen corresponding path program 1 times [2022-11-23 15:42:22,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:22,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382274144] [2022-11-23 15:42:22,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:22,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:22,854 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:22,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382274144] [2022-11-23 15:42:22,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382274144] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:22,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:22,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:42:22,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38030670] [2022-11-23 15:42:22,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:22,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:42:22,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:22,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:42:22,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:22,857 INFO L87 Difference]: Start difference. First operand 279 states and 641 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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) [2022-11-23 15:42:22,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:22,945 INFO L93 Difference]: Finished difference Result 231 states and 547 transitions. [2022-11-23 15:42:22,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:42:22,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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 [2022-11-23 15:42:22,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:22,947 INFO L225 Difference]: With dead ends: 231 [2022-11-23 15:42:22,947 INFO L226 Difference]: Without dead ends: 219 [2022-11-23 15:42:22,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:22,948 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 46 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:22,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 8 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-23 15:42:22,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 204. [2022-11-23 15:42:22,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 203 states have (on average 2.3793103448275863) internal successors, (483), 203 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 483 transitions. [2022-11-23 15:42:22,955 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 483 transitions. Word has length 19 [2022-11-23 15:42:22,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:22,955 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 483 transitions. [2022-11-23 15:42:22,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 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) [2022-11-23 15:42:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 483 transitions. [2022-11-23 15:42:22,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:42:22,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:22,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:22,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:42:22,957 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:22,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:22,958 INFO L85 PathProgramCache]: Analyzing trace with hash -153903111, now seen corresponding path program 1 times [2022-11-23 15:42:22,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:22,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102391004] [2022-11-23 15:42:22,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:22,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:23,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:23,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102391004] [2022-11-23 15:42:23,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102391004] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:23,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:23,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:42:23,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916125598] [2022-11-23 15:42:23,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:23,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:42:23,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:23,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:42:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:42:23,257 INFO L87 Difference]: Start difference. First operand 204 states and 483 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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) [2022-11-23 15:42:23,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:23,412 INFO L93 Difference]: Finished difference Result 345 states and 792 transitions. [2022-11-23 15:42:23,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:42:23,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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 [2022-11-23 15:42:23,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:23,414 INFO L225 Difference]: With dead ends: 345 [2022-11-23 15:42:23,414 INFO L226 Difference]: Without dead ends: 166 [2022-11-23 15:42:23,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:42:23,415 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 35 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:23,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 12 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:23,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-23 15:42:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-23 15:42:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.296969696969697) internal successors, (379), 165 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:23,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 379 transitions. [2022-11-23 15:42:23,420 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 379 transitions. Word has length 23 [2022-11-23 15:42:23,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:23,420 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 379 transitions. [2022-11-23 15:42:23,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 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) [2022-11-23 15:42:23,420 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 379 transitions. [2022-11-23 15:42:23,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:42:23,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:23,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:23,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 15:42:23,421 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:23,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 818650755, now seen corresponding path program 2 times [2022-11-23 15:42:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:23,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578629935] [2022-11-23 15:42:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:24,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:24,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:42:24,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578629935] [2022-11-23 15:42:24,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578629935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:24,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:24,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:42:24,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940901658] [2022-11-23 15:42:24,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:24,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:42:24,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:42:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:42:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:42:24,380 INFO L87 Difference]: Start difference. First operand 166 states and 379 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2022-11-23 15:42:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:24,601 INFO L93 Difference]: Finished difference Result 201 states and 442 transitions. [2022-11-23 15:42:24,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:42:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 [2022-11-23 15:42:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:24,602 INFO L225 Difference]: With dead ends: 201 [2022-11-23 15:42:24,602 INFO L226 Difference]: Without dead ends: 118 [2022-11-23 15:42:24,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:42:24,603 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:24,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 29 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:42:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-23 15:42:24,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-23 15:42:24,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.0598290598290596) internal successors, (241), 117 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:24,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 241 transitions. [2022-11-23 15:42:24,607 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 241 transitions. Word has length 23 [2022-11-23 15:42:24,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:24,607 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 241 transitions. [2022-11-23 15:42:24,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2022-11-23 15:42:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 241 transitions. [2022-11-23 15:42:24,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:42:24,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:24,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:24,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 15:42:24,608 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:24,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1483582673, now seen corresponding path program 3 times [2022-11-23 15:42:24,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:42:24,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080376012] [2022-11-23 15:42:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:42:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:42:24,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:42:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:42:24,719 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:42:24,720 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:42:24,721 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-23 15:42:24,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-23 15:42:24,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-23 15:42:24,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-23 15:42:24,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-23 15:42:24,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-23 15:42:24,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-23 15:42:24,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-23 15:42:24,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-23 15:42:24,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-23 15:42:24,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-23 15:42:24,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-23 15:42:24,725 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-23 15:42:24,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 15:42:24,728 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:24,733 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 15:42:24,733 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:42:24,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:42:24 BasicIcfg [2022-11-23 15:42:24,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:42:24,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:42:24,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:42:24,821 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:42:24,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:11" (3/4) ... [2022-11-23 15:42:24,824 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:42:24,824 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:42:24,825 INFO L158 Benchmark]: Toolchain (without parser) took 14859.32ms. Allocated memory was 184.5MB in the beginning and 285.2MB in the end (delta: 100.7MB). Free memory was 136.9MB in the beginning and 185.3MB in the end (delta: -48.4MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2022-11-23 15:42:24,825 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory was 92.8MB in the beginning and 92.7MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:42:24,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.87ms. Allocated memory is still 184.5MB. Free memory was 136.9MB in the beginning and 113.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 15:42:24,826 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.42ms. Allocated memory is still 184.5MB. Free memory was 113.8MB in the beginning and 111.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:42:24,826 INFO L158 Benchmark]: Boogie Preprocessor took 34.03ms. Allocated memory is still 184.5MB. Free memory was 111.2MB in the beginning and 109.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:42:24,826 INFO L158 Benchmark]: RCFGBuilder took 907.61ms. Allocated memory is still 184.5MB. Free memory was 109.1MB in the beginning and 126.7MB in the end (delta: -17.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. [2022-11-23 15:42:24,827 INFO L158 Benchmark]: TraceAbstraction took 13132.00ms. Allocated memory was 184.5MB in the beginning and 285.2MB in the end (delta: 100.7MB). Free memory was 125.6MB in the beginning and 186.3MB in the end (delta: -60.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. [2022-11-23 15:42:24,827 INFO L158 Benchmark]: Witness Printer took 3.50ms. Allocated memory is still 285.2MB. Free memory was 186.3MB in the beginning and 185.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:42:24,829 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 127.9MB. Free memory was 92.8MB in the beginning and 92.7MB in the end (delta: 27.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.87ms. Allocated memory is still 184.5MB. Free memory was 136.9MB in the beginning and 113.8MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.42ms. Allocated memory is still 184.5MB. Free memory was 113.8MB in the beginning and 111.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.03ms. Allocated memory is still 184.5MB. Free memory was 111.2MB in the beginning and 109.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 907.61ms. Allocated memory is still 184.5MB. Free memory was 109.1MB in the beginning and 126.7MB in the end (delta: -17.6MB). Peak memory consumption was 12.9MB. Max. memory is 16.1GB. * TraceAbstraction took 13132.00ms. Allocated memory was 184.5MB in the beginning and 285.2MB in the end (delta: 100.7MB). Free memory was 125.6MB in the beginning and 186.3MB in the end (delta: -60.7MB). Peak memory consumption was 41.0MB. Max. memory is 16.1GB. * Witness Printer took 3.50ms. Allocated memory is still 285.2MB. Free memory was 186.3MB in the beginning and 185.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 138 PlacesBefore, 45 PlacesAfterwards, 130 TransitionsBefore, 36 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 7 FixpointIterations, 51 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 6739 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3851, independent: 3670, independent conditional: 0, independent unconditional: 3670, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1890, independent: 1840, independent conditional: 0, independent unconditional: 1840, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1890, independent: 1824, independent conditional: 0, independent unconditional: 1824, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 66, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 375, independent: 66, independent conditional: 0, independent unconditional: 66, dependent: 309, dependent conditional: 0, dependent unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3851, independent: 1830, independent conditional: 0, independent unconditional: 1830, dependent: 131, dependent conditional: 0, dependent unconditional: 131, unknown: 1890, unknown conditional: 0, unknown unconditional: 1890] , Statistics on independence cache: Total cache size (in pairs): 250, Positive cache size: 229, Positive conditional cache size: 0, Positive unconditional cache size: 229, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t636, ((void *)0), P0, ((void *)0))=-3, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t637, ((void *)0), P1, ((void *)0))=-2, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t638, ((void *)0), P2, ((void *)0))=-1, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 2 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 z = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L750] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 x = 1 [L756] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~cond-unknown=1, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=255, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 159 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 12.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 166 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 102 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1303 IncrementalHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 64 mSDtfsCounter, 1303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1698occurred in iteration=4, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 2265 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 192 NumberOfCodeBlocks, 192 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 1335 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 [2022-11-23 15:42:24,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-4e7fbc6 [2022-11-23 15:42:27,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:42:27,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:42:27,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:42:27,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:42:27,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:42:27,207 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:42:27,211 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:42:27,213 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:42:27,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:42:27,219 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:42:27,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:42:27,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:42:27,225 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:42:27,227 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:42:27,228 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:42:27,229 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:42:27,230 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:42:27,232 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:42:27,234 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:42:27,235 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:42:27,237 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:42:27,238 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:42:27,239 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:42:27,242 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:42:27,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:42:27,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:42:27,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:42:27,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:42:27,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:42:27,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:42:27,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:42:27,248 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:42:27,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:42:27,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:42:27,250 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:42:27,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:42:27,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:42:27,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:42:27,252 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:42:27,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:42:27,254 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-23 15:42:27,276 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:42:27,277 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:42:27,277 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:42:27,278 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:42:27,278 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:42:27,279 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:42:27,279 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:42:27,279 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:42:27,279 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:42:27,280 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:42:27,280 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:42:27,280 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:42:27,281 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-23 15:42:27,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-23 15:42:27,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:42:27,281 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:42:27,282 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-23 15:42:27,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:42:27,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:42:27,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:42:27,283 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-23 15:42:27,283 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-23 15:42:27,283 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-23 15:42:27,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:42:27,284 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-23 15:42:27,284 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-23 15:42:27,284 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-23 15:42:27,284 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:42:27,284 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:42:27,285 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:42:27,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-23 15:42:27,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:42:27,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:42:27,286 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:42:27,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:42:27,286 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-23 15:42:27,286 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-23 15:42:27,287 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:42:27,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-23 15:42:27,287 INFO L138 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_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 [2022-11-23 15:42:27,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:42:27,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:42:27,734 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:42:27,735 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:42:27,736 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:42:27,737 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-11-23 15:42:30,714 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:42:31,087 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:42:31,091 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-11-23 15:42:31,110 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/data/7d1cdbfd5/b009da9630574a989b24fac7db86d1a7/FLAGa9d117b27 [2022-11-23 15:42:31,134 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/data/7d1cdbfd5/b009da9630574a989b24fac7db86d1a7 [2022-11-23 15:42:31,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:42:31,141 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:42:31,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:42:31,145 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:42:31,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:42:31,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ddb3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31, skipping insertion in model container [2022-11-23 15:42:31,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,157 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:42:31,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:42:31,391 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-11-23 15:42:31,678 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:42:31,699 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:42:31,719 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-11-23 15:42:31,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:42:31,861 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:42:31,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31 WrapperNode [2022-11-23 15:42:31,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:42:31,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:42:31,863 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:42:31,863 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:42:31,871 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,927 INFO L138 Inliner]: procedures = 179, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 132 [2022-11-23 15:42:31,928 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:42:31,929 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:42:31,929 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:42:31,929 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:42:31,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,950 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,991 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,992 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:31,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:42:31,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:42:32,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:42:32,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:42:32,018 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (1/1) ... [2022-11-23 15:42:32,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:42:32,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:42:32,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:42:32,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:42:32,098 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 15:42:32,098 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:42:32,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:42:32,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:42:32,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-23 15:42:32,099 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-23 15:42:32,099 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 15:42:32,099 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 15:42:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 15:42:32,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 15:42:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 15:42:32,100 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 15:42:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 15:42:32,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:42:32,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:42:32,102 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 15:42:32,339 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:42:32,341 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:42:32,764 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:42:33,038 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:42:33,045 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:42:33,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:33 BoogieIcfgContainer [2022-11-23 15:42:33,054 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:42:33,057 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:42:33,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:42:33,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:42:33,062 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:42:31" (1/3) ... [2022-11-23 15:42:33,062 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba18cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:42:33, skipping insertion in model container [2022-11-23 15:42:33,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:42:31" (2/3) ... [2022-11-23 15:42:33,063 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ba18cbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:42:33, skipping insertion in model container [2022-11-23 15:42:33,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:33" (3/3) ... [2022-11-23 15:42:33,065 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2022-11-23 15:42:33,084 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:42:33,084 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-23 15:42:33,084 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:42:33,204 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 15:42:33,254 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:42:33,268 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-23 15:42:33,271 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 131 transitions, 277 flow [2022-11-23 15:42:33,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 277 flow [2022-11-23 15:42:33,331 INFO L130 PetriNetUnfolder]: 2/128 cut-off events. [2022-11-23 15:42:33,331 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 15:42:33,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 128 events. 2/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 90 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-11-23 15:42:33,340 INFO L119 LiptonReduction]: Number of co-enabled transitions 2544 [2022-11-23 15:42:42,071 INFO L134 LiptonReduction]: Checked pairs total: 6731 [2022-11-23 15:42:42,071 INFO L136 LiptonReduction]: Total number of compositions: 126 [2022-11-23 15:42:42,082 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 45 places, 36 transitions, 87 flow [2022-11-23 15:42:42,188 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1284 states, 1271 states have (on average 3.373721479150275) internal successors, (4288), 1283 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:42,212 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:42:42,223 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@b603818, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:42:42,223 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-23 15:42:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 1284 states, 1271 states have (on average 3.373721479150275) internal successors, (4288), 1283 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:42,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-23 15:42:42,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:42,232 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-23 15:42:42,233 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:42,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:42,237 INFO L85 PathProgramCache]: Analyzing trace with hash 548, now seen corresponding path program 1 times [2022-11-23 15:42:42,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:42:42,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929147117] [2022-11-23 15:42:42,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:42,249 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 [2022-11-23 15:42:42,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:42:42,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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) [2022-11-23 15:42:42,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:42,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-23 15:42:42,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:42:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:42,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:42:42,360 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:42:42,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929147117] [2022-11-23 15:42:42,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929147117] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:42,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:42,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-23 15:42:42,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775681162] [2022-11-23 15:42:42,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:42,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-23 15:42:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:42:42,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-23 15:42:42,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:42:42,395 INFO L87 Difference]: Start difference. First operand has 1284 states, 1271 states have (on average 3.373721479150275) internal successors, (4288), 1283 states have internal predecessors, (4288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:42,612 INFO L93 Difference]: Finished difference Result 1212 states and 3930 transitions. [2022-11-23 15:42:42,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-23 15:42:42,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1 [2022-11-23 15:42:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:42,640 INFO L225 Difference]: With dead ends: 1212 [2022-11-23 15:42:42,641 INFO L226 Difference]: Without dead ends: 1212 [2022-11-23 15:42:42,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-23 15:42:42,645 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:42,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2022-11-23 15:42:42,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2022-11-23 15:42:42,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1207 states have (on average 3.256006628003314) internal successors, (3930), 1211 states have internal predecessors, (3930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 3930 transitions. [2022-11-23 15:42:42,773 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 3930 transitions. Word has length 1 [2022-11-23 15:42:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:42,773 INFO L495 AbstractCegarLoop]: Abstraction has 1212 states and 3930 transitions. [2022-11-23 15:42:42,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:42,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 3930 transitions. [2022-11-23 15:42:42,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-23 15:42:42,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:42,774 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-23 15:42:42,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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)] Forceful destruction successful, exit code 0 [2022-11-23 15:42:42,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:42,987 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:42,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:42,988 INFO L85 PathProgramCache]: Analyzing trace with hash 520071089, now seen corresponding path program 1 times [2022-11-23 15:42:42,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:42:42,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860317529] [2022-11-23 15:42:42,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:42,989 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 [2022-11-23 15:42:42,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:42:42,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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) [2022-11-23 15:42:43,046 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:43,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:42:43,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:42:43,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:43,164 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:42:43,164 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:42:43,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860317529] [2022-11-23 15:42:43,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860317529] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:43,165 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:43,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:42:43,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180805764] [2022-11-23 15:42:43,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:43,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:42:43,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:42:43,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:42:43,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:42:43,172 INFO L87 Difference]: Start difference. First operand 1212 states and 3930 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:43,308 INFO L93 Difference]: Finished difference Result 992 states and 3169 transitions. [2022-11-23 15:42:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:42:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-23 15:42:43,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:43,317 INFO L225 Difference]: With dead ends: 992 [2022-11-23 15:42:43,317 INFO L226 Difference]: Without dead ends: 962 [2022-11-23 15:42:43,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:42:43,320 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:43,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 6 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-11-23 15:42:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-11-23 15:42:43,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 3.21875) internal successors, (3090), 961 states have internal predecessors, (3090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 3090 transitions. [2022-11-23 15:42:43,364 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 3090 transitions. Word has length 5 [2022-11-23 15:42:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:43,365 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 3090 transitions. [2022-11-23 15:42:43,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 3090 transitions. [2022-11-23 15:42:43,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 15:42:43,367 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:43,367 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:43,387 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:43,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:43,579 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash 241041133, now seen corresponding path program 1 times [2022-11-23 15:42:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:42:43,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [550425045] [2022-11-23 15:42:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:43,581 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 [2022-11-23 15:42:43,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:42:43,591 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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) [2022-11-23 15:42:43,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-23 15:42:43,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:43,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:42:43,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:42:43,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:43,756 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:42:43,756 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:42:43,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [550425045] [2022-11-23 15:42:43,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [550425045] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:43,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:43,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:42:43,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737972150] [2022-11-23 15:42:43,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:43,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:42:43,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:42:43,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:42:43,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:42:43,758 INFO L87 Difference]: Start difference. First operand 962 states and 3090 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:43,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:43,899 INFO L93 Difference]: Finished difference Result 562 states and 1490 transitions. [2022-11-23 15:42:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:42:43,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-11-23 15:42:43,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:43,903 INFO L225 Difference]: With dead ends: 562 [2022-11-23 15:42:43,903 INFO L226 Difference]: Without dead ends: 562 [2022-11-23 15:42:43,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:42:43,904 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:43,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 6 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:43,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2022-11-23 15:42:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2022-11-23 15:42:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 560 states have (on average 2.6607142857142856) internal successors, (1490), 561 states have internal predecessors, (1490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:43,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1490 transitions. [2022-11-23 15:42:43,957 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1490 transitions. Word has length 10 [2022-11-23 15:42:43,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:43,957 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 1490 transitions. [2022-11-23 15:42:43,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:43,958 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1490 transitions. [2022-11-23 15:42:43,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:42:43,960 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:43,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:43,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-23 15:42:44,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:44,177 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:44,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1328795492, now seen corresponding path program 1 times [2022-11-23 15:42:44,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:42:44,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300236174] [2022-11-23 15:42:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:44,179 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 [2022-11-23 15:42:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:42:44,181 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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) [2022-11-23 15:42:44,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-23 15:42:44,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:44,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-23 15:42:44,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:42:44,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:44,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:42:44,371 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:42:44,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300236174] [2022-11-23 15:42:44,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300236174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:44,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:44,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:42:44,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31783266] [2022-11-23 15:42:44,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:44,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:42:44,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:42:44,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:42:44,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:42:44,373 INFO L87 Difference]: Start difference. First operand 562 states and 1490 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:44,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:44,524 INFO L93 Difference]: Finished difference Result 282 states and 650 transitions. [2022-11-23 15:42:44,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:42:44,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-23 15:42:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:44,526 INFO L225 Difference]: With dead ends: 282 [2022-11-23 15:42:44,527 INFO L226 Difference]: Without dead ends: 282 [2022-11-23 15:42:44,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:42:44,528 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:44,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-11-23 15:42:44,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2022-11-23 15:42:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 280 states have (on average 2.3214285714285716) internal successors, (650), 281 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:44,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 650 transitions. [2022-11-23 15:42:44,539 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 650 transitions. Word has length 14 [2022-11-23 15:42:44,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:44,539 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 650 transitions. [2022-11-23 15:42:44,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:44,539 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 650 transitions. [2022-11-23 15:42:44,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 15:42:44,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:44,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:44,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-23 15:42:44,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:44,754 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:44,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash 502056042, now seen corresponding path program 1 times [2022-11-23 15:42:44,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:42:44,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838188963] [2022-11-23 15:42:44,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:44,755 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 [2022-11-23 15:42:44,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:42:44,757 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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) [2022-11-23 15:42:44,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-23 15:42:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:44,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-23 15:42:44,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:42:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:44,961 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:42:44,962 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:42:44,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838188963] [2022-11-23 15:42:44,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838188963] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:44,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:44,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:42:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285880459] [2022-11-23 15:42:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:44,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:42:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:42:44,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:42:44,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:44,964 INFO L87 Difference]: Start difference. First operand 282 states and 650 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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) [2022-11-23 15:42:45,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:45,184 INFO L93 Difference]: Finished difference Result 217 states and 520 transitions. [2022-11-23 15:42:45,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:42:45,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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 [2022-11-23 15:42:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:45,186 INFO L225 Difference]: With dead ends: 217 [2022-11-23 15:42:45,186 INFO L226 Difference]: Without dead ends: 217 [2022-11-23 15:42:45,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:45,187 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 30 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:45,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 27 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:42:45,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-23 15:42:45,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2022-11-23 15:42:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 215 states have (on average 2.4186046511627906) internal successors, (520), 216 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 520 transitions. [2022-11-23 15:42:45,199 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 520 transitions. Word has length 18 [2022-11-23 15:42:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:45,199 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 520 transitions. [2022-11-23 15:42:45,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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) [2022-11-23 15:42:45,200 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 520 transitions. [2022-11-23 15:42:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:42:45,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:45,201 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:45,218 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-23 15:42:45,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:45,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:45,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:45,415 INFO L85 PathProgramCache]: Analyzing trace with hash 930748577, now seen corresponding path program 1 times [2022-11-23 15:42:45,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:42:45,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1790648966] [2022-11-23 15:42:45,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:45,416 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 [2022-11-23 15:42:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:42:45,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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) [2022-11-23 15:42:45,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-23 15:42:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:45,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 15:42:45,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:42:46,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:46,056 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:42:46,057 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:42:46,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1790648966] [2022-11-23 15:42:46,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1790648966] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:46,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:46,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:42:46,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712629022] [2022-11-23 15:42:46,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:46,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:42:46,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:42:46,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:42:46,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:46,058 INFO L87 Difference]: Start difference. First operand 217 states and 520 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:46,308 INFO L93 Difference]: Finished difference Result 216 states and 519 transitions. [2022-11-23 15:42:46,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:42:46,308 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-23 15:42:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:46,309 INFO L225 Difference]: With dead ends: 216 [2022-11-23 15:42:46,309 INFO L226 Difference]: Without dead ends: 216 [2022-11-23 15:42:46,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:46,310 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:46,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 12 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:42:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2022-11-23 15:42:46,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-11-23 15:42:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 215 states have (on average 2.4139534883720932) internal successors, (519), 215 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 519 transitions. [2022-11-23 15:42:46,322 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 519 transitions. Word has length 23 [2022-11-23 15:42:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:46,322 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 519 transitions. [2022-11-23 15:42:46,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 519 transitions. [2022-11-23 15:42:46,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:42:46,324 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:46,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:46,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-23 15:42:46,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:46,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:46,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash 930748560, now seen corresponding path program 1 times [2022-11-23 15:42:46,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:42:46,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359075902] [2022-11-23 15:42:46,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:42:46,544 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 [2022-11-23 15:42:46,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:42:46,545 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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) [2022-11-23 15:42:46,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-23 15:42:46,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:42:46,689 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-23 15:42:46,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:42:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:46,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:42:46,734 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:42:46,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359075902] [2022-11-23 15:42:46,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359075902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:46,734 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:46,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:42:46,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480396113] [2022-11-23 15:42:46,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:46,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:42:46,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:42:46,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:42:46,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:42:46,736 INFO L87 Difference]: Start difference. First operand 216 states and 519 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:46,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:46,869 INFO L93 Difference]: Finished difference Result 294 states and 692 transitions. [2022-11-23 15:42:46,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:42:46,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-23 15:42:46,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:46,871 INFO L225 Difference]: With dead ends: 294 [2022-11-23 15:42:46,871 INFO L226 Difference]: Without dead ends: 166 [2022-11-23 15:42:46,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:42:46,872 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:46,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:42:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-23 15:42:46,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2022-11-23 15:42:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 2.296969696969697) internal successors, (379), 165 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:46,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 379 transitions. [2022-11-23 15:42:46,877 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 379 transitions. Word has length 23 [2022-11-23 15:42:46,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:46,877 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 379 transitions. [2022-11-23 15:42:46,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:46,878 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 379 transitions. [2022-11-23 15:42:46,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:42:46,879 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:46,879 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:46,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-23 15:42:47,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:47,091 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:47,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:47,091 INFO L85 PathProgramCache]: Analyzing trace with hash -114783560, now seen corresponding path program 2 times [2022-11-23 15:42:47,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:42:47,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [236527422] [2022-11-23 15:42:47,092 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-23 15:42:47,092 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 [2022-11-23 15:42:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:42:47,094 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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) [2022-11-23 15:42:47,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 (9)] Waiting until timeout for monitored process [2022-11-23 15:42:47,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-23 15:42:47,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-23 15:42:47,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-23 15:42:47,237 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:42:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:42:47,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:42:47,540 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-23 15:42:47,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [236527422] [2022-11-23 15:42:47,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [236527422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:42:47,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:42:47,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:42:47,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898813708] [2022-11-23 15:42:47,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:42:47,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:42:47,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-23 15:42:47,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:42:47,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:42:47,542 INFO L87 Difference]: Start difference. First operand 166 states and 379 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2022-11-23 15:42:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:42:47,844 INFO L93 Difference]: Finished difference Result 201 states and 442 transitions. [2022-11-23 15:42:47,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:42:47,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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 [2022-11-23 15:42:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:42:47,845 INFO L225 Difference]: With dead ends: 201 [2022-11-23 15:42:47,846 INFO L226 Difference]: Without dead ends: 118 [2022-11-23 15:42:47,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:42:47,846 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 59 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:42:47,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 26 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:42:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-23 15:42:47,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-11-23 15:42:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 2.0598290598290596) internal successors, (241), 117 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 15:42:47,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 241 transitions. [2022-11-23 15:42:47,851 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 241 transitions. Word has length 23 [2022-11-23 15:42:47,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:42:47,852 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 241 transitions. [2022-11-23 15:42:47,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 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) [2022-11-23 15:42:47,852 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 241 transitions. [2022-11-23 15:42:47,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-23 15:42:47,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:42:47,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:47,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 (9)] Forceful destruction successful, exit code 0 [2022-11-23 15:42:48,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:48,062 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-23 15:42:48,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:42:48,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1486868994, now seen corresponding path program 3 times [2022-11-23 15:42:48,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-23 15:42:48,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697154896] [2022-11-23 15:42:48,063 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-23 15:42:48,064 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 [2022-11-23 15:42:48,064 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/mathsat [2022-11-23 15:42:48,065 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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) [2022-11-23 15:42:48,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 (10)] Waiting until timeout for monitored process [2022-11-23 15:42:48,233 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-23 15:42:48,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-23 15:42:48,233 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:42:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:42:48,394 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-23 15:42:48,394 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:42:48,395 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-23 15:42:48,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-23 15:42:48,397 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-23 15:42:48,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-23 15:42:48,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-23 15:42:48,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-23 15:42:48,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-23 15:42:48,398 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-23 15:42:48,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-23 15:42:48,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-23 15:42:48,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-23 15:42:48,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-23 15:42:48,399 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-23 15:42:48,417 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 (10)] Forceful destruction successful, exit code 0 [2022-11-23 15:42:48,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/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 [2022-11-23 15:42:48,610 INFO L444 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2022-11-23 15:42:48,615 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 15:42:48,616 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:42:48,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:42:48 BasicIcfg [2022-11-23 15:42:48,730 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:42:48,731 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:42:48,731 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:42:48,731 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:42:48,732 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:42:33" (3/4) ... [2022-11-23 15:42:48,734 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-23 15:42:48,735 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:42:48,735 INFO L158 Benchmark]: Toolchain (without parser) took 17593.89ms. Allocated memory was 65.0MB in the beginning and 117.4MB in the end (delta: 52.4MB). Free memory was 41.5MB in the beginning and 28.2MB in the end (delta: 13.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2022-11-23 15:42:48,736 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 65.0MB. Free memory was 42.2MB in the beginning and 42.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:42:48,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 717.78ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 41.3MB in the beginning and 47.3MB in the end (delta: -6.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-11-23 15:42:48,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.19ms. Allocated memory is still 79.7MB. Free memory was 47.3MB in the beginning and 44.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 15:42:48,737 INFO L158 Benchmark]: Boogie Preprocessor took 67.56ms. Allocated memory is still 79.7MB. Free memory was 44.7MB in the beginning and 42.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:42:48,737 INFO L158 Benchmark]: RCFGBuilder took 1057.71ms. Allocated memory is still 79.7MB. Free memory was 42.6MB in the beginning and 53.0MB in the end (delta: -10.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2022-11-23 15:42:48,737 INFO L158 Benchmark]: TraceAbstraction took 15673.51ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 52.6MB in the beginning and 28.2MB in the end (delta: 24.4MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-11-23 15:42:48,738 INFO L158 Benchmark]: Witness Printer took 3.87ms. Allocated memory is still 117.4MB. Free memory is still 28.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:42:48,740 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 65.0MB. Free memory was 42.2MB in the beginning and 42.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 717.78ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 41.3MB in the beginning and 47.3MB in the end (delta: -6.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.19ms. Allocated memory is still 79.7MB. Free memory was 47.3MB in the beginning and 44.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.56ms. Allocated memory is still 79.7MB. Free memory was 44.7MB in the beginning and 42.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1057.71ms. Allocated memory is still 79.7MB. Free memory was 42.6MB in the beginning and 53.0MB in the end (delta: -10.4MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * TraceAbstraction took 15673.51ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 52.6MB in the beginning and 28.2MB in the end (delta: 24.4MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * Witness Printer took 3.87ms. Allocated memory is still 117.4MB. Free memory is still 28.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.8s, 139 PlacesBefore, 45 PlacesAfterwards, 131 TransitionsBefore, 36 TransitionsAfterwards, 2544 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 126 TotalNumberOfCompositions, 6731 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3510, independent: 3329, independent conditional: 0, independent unconditional: 3329, dependent: 181, dependent conditional: 0, dependent unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1753, independent: 1707, independent conditional: 0, independent unconditional: 1707, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1753, independent: 1690, independent conditional: 0, independent unconditional: 1690, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 326, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 276, dependent conditional: 0, dependent unconditional: 276, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3510, independent: 1622, independent conditional: 0, independent unconditional: 1622, dependent: 135, dependent conditional: 0, dependent unconditional: 135, unknown: 1753, unknown conditional: 0, unknown unconditional: 1753] , Statistics on independence cache: Total cache size (in pairs): 206, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L727] 0 _Bool y$flush_delayed; [L728] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd0; [L730] 0 _Bool y$r_buff0_thd1; [L731] 0 _Bool y$r_buff0_thd2; [L732] 0 _Bool y$r_buff0_thd3; [L733] 0 _Bool y$r_buff1_thd0; [L734] 0 _Bool y$r_buff1_thd1; [L735] 0 _Bool y$r_buff1_thd2; [L736] 0 _Bool y$r_buff1_thd3; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L844] 0 pthread_t t636; [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t636, ((void *)0), P0, ((void *)0))=0, t636={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t637; [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t637, ((void *)0), P1, ((void *)0))=1, t636={3:0}, t637={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t638; [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t638, ((void *)0), P2, ((void *)0))=2, t636={3:0}, t637={7:0}, t638={256:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 2 z = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 z = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L750] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 x = 1 [L756] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 2 return 0; [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~cond-unknown=1, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={3:0}, t637={7:0}, t638={256:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=1, unknown-#in~expression-unknown=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 160 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 15.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 150 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 150 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 674 IncrementalHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 39 mSDtfsCounter, 674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1284occurred in iteration=0, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 109 ConstructedInterpolants, 18 QuantifiedInterpolants, 1166 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1001 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-23 15:42:48,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02192e63-3f8e-4dcd-ac76-ce2974a6833e/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample