./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS --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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --- 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-8393723 [2022-11-19 07:24:30,326 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:24:30,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:24:30,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:24:30,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:24:30,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:24:30,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:24:30,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:24:30,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:24:30,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:24:30,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:24:30,357 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:24:30,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:24:30,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:24:30,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:24:30,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:24:30,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:24:30,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:24:30,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:24:30,368 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:24:30,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:24:30,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:24:30,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:24:30,386 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:24:30,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:24:30,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:24:30,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:24:30,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:24:30,402 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:24:30,403 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:24:30,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:24:30,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:24:30,405 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:24:30,406 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:24:30,409 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:24:30,410 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:24:30,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:24:30,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:24:30,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:24:30,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:24:30,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:24:30,415 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-19 07:24:30,454 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:24:30,456 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:24:30,457 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:24:30,457 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:24:30,458 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:24:30,458 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:24:30,459 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:24:30,459 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:24:30,459 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:24:30,459 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:24:30,460 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:24:30,461 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:24:30,461 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:24:30,461 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:24:30,461 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:24:30,462 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:24:30,462 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:24:30,462 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:24:30,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:24:30,463 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:24:30,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:24:30,465 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:24:30,465 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:24:30,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:24:30,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:24:30,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:24:30,466 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:24:30,467 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:24:30,467 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:24:30,467 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:24:30,468 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:24:30,468 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:24:30,468 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:24:30,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:24:30,468 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:24:30,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:24:30,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:24:30,470 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:24:30,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:24:30,470 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:24:30,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:24:30,471 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:24:30,471 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_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 [2022-11-19 07:24:30,803 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:24:30,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:24:30,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:24:30,830 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:24:30,831 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:24:30,833 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2022-11-19 07:24:30,906 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data/383b4e60d/794d4917df7b4b4ebca9eab5904aa08d/FLAGae96eb44b [2022-11-19 07:24:31,557 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:24:31,558 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2022-11-19 07:24:31,572 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data/383b4e60d/794d4917df7b4b4ebca9eab5904aa08d/FLAGae96eb44b [2022-11-19 07:24:31,809 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data/383b4e60d/794d4917df7b4b4ebca9eab5904aa08d [2022-11-19 07:24:31,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:24:31,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:24:31,820 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:24:31,820 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:24:31,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:24:31,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:24:31" (1/1) ... [2022-11-19 07:24:31,827 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199c2f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:31, skipping insertion in model container [2022-11-19 07:24:31,828 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:24:31" (1/1) ... [2022-11-19 07:24:31,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:24:31,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:24:32,132 WARN L234 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_e34b69da-5864-4d2e-b093-59ac073e1d08/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2022-11-19 07:24:32,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:24:32,425 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:24:32,437 WARN L234 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_e34b69da-5864-4d2e-b093-59ac073e1d08/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2022-11-19 07:24:32,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:24:32,542 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:24:32,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32 WrapperNode [2022-11-19 07:24:32,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:24:32,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:24:32,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:24:32,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:24:32,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,567 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,595 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 158 [2022-11-19 07:24:32,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:24:32,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:24:32,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:24:32,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:24:32,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,623 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:24:32,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:24:32,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:24:32,632 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:24:32,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (1/1) ... [2022-11-19 07:24:32,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:24:32,664 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:24:32,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:24:32,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:24:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:24:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:24:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:24:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:24:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:24:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:24:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:24:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:24:32,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:24:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:24:32,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:24:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:24:32,735 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:24:32,735 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:24:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:24:32,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:24:32,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:24:32,737 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:24:32,975 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:24:32,977 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:24:33,376 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:24:33,545 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:24:33,545 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:24:33,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:33 BoogieIcfgContainer [2022-11-19 07:24:33,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:24:33,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:24:33,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:24:33,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:24:33,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:24:31" (1/3) ... [2022-11-19 07:24:33,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7e21b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:24:33, skipping insertion in model container [2022-11-19 07:24:33,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:24:32" (2/3) ... [2022-11-19 07:24:33,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d7e21b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:24:33, skipping insertion in model container [2022-11-19 07:24:33,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:33" (3/3) ... [2022-11-19 07:24:33,561 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2022-11-19 07:24:33,583 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:24:33,583 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-19 07:24:33,584 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:24:33,688 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:24:33,744 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:24:33,755 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 157 places, 146 transitions, 312 flow [2022-11-19 07:24:33,760 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 157 places, 146 transitions, 312 flow [2022-11-19 07:24:33,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 157 places, 146 transitions, 312 flow [2022-11-19 07:24:33,873 INFO L130 PetriNetUnfolder]: 2/142 cut-off events. [2022-11-19 07:24:33,873 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:24:33,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 2/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-19 07:24:33,886 INFO L119 LiptonReduction]: Number of co-enabled transitions 3434 [2022-11-19 07:24:41,784 INFO L134 LiptonReduction]: Checked pairs total: 9510 [2022-11-19 07:24:41,785 INFO L136 LiptonReduction]: Total number of compositions: 145 [2022-11-19 07:24:41,793 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 43 transitions, 106 flow [2022-11-19 07:24:42,057 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4380 states, 4365 states have (on average 4.052691867124857) internal successors, (17690), 4379 states have internal predecessors, (17690), 0 states have call successors, (0), 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-19 07:24:42,080 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:24:42,092 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;@2999e494, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:24:42,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-19 07:24:42,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 4380 states, 4365 states have (on average 4.052691867124857) internal successors, (17690), 4379 states have internal predecessors, (17690), 0 states have call successors, (0), 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-19 07:24:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:24:42,115 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:42,116 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:24:42,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:42,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:42,125 INFO L85 PathProgramCache]: Analyzing trace with hash 611, now seen corresponding path program 1 times [2022-11-19 07:24:42,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:42,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278936110] [2022-11-19 07:24:42,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:42,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:42,239 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-19 07:24:42,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:42,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278936110] [2022-11-19 07:24:42,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278936110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:42,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:42,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:24:42,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433883425] [2022-11-19 07:24:42,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:42,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:24:42,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:42,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:24:42,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:24:42,303 INFO L87 Difference]: Start difference. First operand has 4380 states, 4365 states have (on average 4.052691867124857) internal successors, (17690), 4379 states have internal predecessors, (17690), 0 states have call successors, (0), 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-19 07:24:42,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:42,502 INFO L93 Difference]: Finished difference Result 4090 states and 16160 transitions. [2022-11-19 07:24:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:24:42,506 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-19 07:24:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:42,565 INFO L225 Difference]: With dead ends: 4090 [2022-11-19 07:24:42,565 INFO L226 Difference]: Without dead ends: 4090 [2022-11-19 07:24:42,566 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-19 07:24:42,570 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:42,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:42,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2022-11-19 07:24:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 4090. [2022-11-19 07:24:42,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4090 states, 4085 states have (on average 3.95593635250918) internal successors, (16160), 4089 states have internal predecessors, (16160), 0 states have call successors, (0), 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-19 07:24:42,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4090 states to 4090 states and 16160 transitions. [2022-11-19 07:24:42,909 INFO L78 Accepts]: Start accepts. Automaton has 4090 states and 16160 transitions. Word has length 1 [2022-11-19 07:24:42,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:42,929 INFO L495 AbstractCegarLoop]: Abstraction has 4090 states and 16160 transitions. [2022-11-19 07:24:42,934 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-19 07:24:42,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4090 states and 16160 transitions. [2022-11-19 07:24:42,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:24:42,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:42,937 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:42,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:24:42,937 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:42,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:42,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1962081410, now seen corresponding path program 1 times [2022-11-19 07:24:42,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:42,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769454446] [2022-11-19 07:24:42,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:43,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:43,373 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-19 07:24:43,373 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:43,374 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769454446] [2022-11-19 07:24:43,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769454446] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:43,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:43,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:24:43,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419285633] [2022-11-19 07:24:43,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:43,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:24:43,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:43,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:24:43,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:24:43,382 INFO L87 Difference]: Start difference. First operand 4090 states and 16160 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-19 07:24:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:43,550 INFO L93 Difference]: Finished difference Result 3350 states and 13073 transitions. [2022-11-19 07:24:43,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:24:43,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-19 07:24:43,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:43,579 INFO L225 Difference]: With dead ends: 3350 [2022-11-19 07:24:43,579 INFO L226 Difference]: Without dead ends: 3250 [2022-11-19 07:24:43,580 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-19 07:24:43,581 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:43,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2022-11-19 07:24:43,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2022-11-19 07:24:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3248 states have (on average 3.9217980295566504) internal successors, (12738), 3249 states have internal predecessors, (12738), 0 states have call successors, (0), 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-19 07:24:43,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2022-11-19 07:24:43,818 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 7 [2022-11-19 07:24:43,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:43,819 INFO L495 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2022-11-19 07:24:43,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-19 07:24:43,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2022-11-19 07:24:43,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-19 07:24:43,823 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:43,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:43,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:24:43,824 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:43,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:43,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1728201669, now seen corresponding path program 1 times [2022-11-19 07:24:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:43,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391189579] [2022-11-19 07:24:43,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:43,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:43,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:45,058 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-19 07:24:45,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:45,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391189579] [2022-11-19 07:24:45,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391189579] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:45,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:45,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:24:45,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863551622] [2022-11-19 07:24:45,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:45,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:45,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:45,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:45,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:45,061 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-19 07:24:45,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:45,367 INFO L93 Difference]: Finished difference Result 5146 states and 19507 transitions. [2022-11-19 07:24:45,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:24:45,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-19 07:24:45,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:45,437 INFO L225 Difference]: With dead ends: 5146 [2022-11-19 07:24:45,437 INFO L226 Difference]: Without dead ends: 5146 [2022-11-19 07:24:45,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:45,439 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 45 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:45,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 6 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:45,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2022-11-19 07:24:45,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 3450. [2022-11-19 07:24:45,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3450 states, 3448 states have (on average 3.91038283062645) internal successors, (13483), 3449 states have internal predecessors, (13483), 0 states have call successors, (0), 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-19 07:24:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3450 states to 3450 states and 13483 transitions. [2022-11-19 07:24:45,645 INFO L78 Accepts]: Start accepts. Automaton has 3450 states and 13483 transitions. Word has length 11 [2022-11-19 07:24:45,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:45,645 INFO L495 AbstractCegarLoop]: Abstraction has 3450 states and 13483 transitions. [2022-11-19 07:24:45,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 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-19 07:24:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3450 states and 13483 transitions. [2022-11-19 07:24:45,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:24:45,648 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:45,649 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:45,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:24:45,649 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:45,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:45,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1316001935, now seen corresponding path program 1 times [2022-11-19 07:24:45,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:45,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465832356] [2022-11-19 07:24:45,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:45,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:46,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-19 07:24:46,474 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:46,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465832356] [2022-11-19 07:24:46,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465832356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:46,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:46,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:24:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305595447] [2022-11-19 07:24:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:46,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:46,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:46,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:46,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:46,480 INFO L87 Difference]: Start difference. First operand 3450 states and 13483 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 07:24:46,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:46,691 INFO L93 Difference]: Finished difference Result 4036 states and 15678 transitions. [2022-11-19 07:24:46,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:24:46,692 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 07:24:46,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:46,721 INFO L225 Difference]: With dead ends: 4036 [2022-11-19 07:24:46,721 INFO L226 Difference]: Without dead ends: 4036 [2022-11-19 07:24:46,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:46,723 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:46,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 10 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4036 states. [2022-11-19 07:24:46,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4036 to 3610. [2022-11-19 07:24:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3610 states, 3608 states have (on average 3.8966186252771617) internal successors, (14059), 3609 states have internal predecessors, (14059), 0 states have call successors, (0), 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-19 07:24:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3610 states to 3610 states and 14059 transitions. [2022-11-19 07:24:46,923 INFO L78 Accepts]: Start accepts. Automaton has 3610 states and 14059 transitions. Word has length 12 [2022-11-19 07:24:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:46,923 INFO L495 AbstractCegarLoop]: Abstraction has 3610 states and 14059 transitions. [2022-11-19 07:24:46,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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-19 07:24:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3610 states and 14059 transitions. [2022-11-19 07:24:46,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:24:46,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:46,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:46,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:24:46,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:46,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:46,926 INFO L85 PathProgramCache]: Analyzing trace with hash -2034643251, now seen corresponding path program 1 times [2022-11-19 07:24:46,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:46,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716638274] [2022-11-19 07:24:46,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:46,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:47,694 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-19 07:24:47,694 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:47,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716638274] [2022-11-19 07:24:47,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716638274] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:47,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:47,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:47,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268330609] [2022-11-19 07:24:47,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:47,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:24:47,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:47,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:24:47,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:47,697 INFO L87 Difference]: Start difference. First operand 3610 states and 14059 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:48,024 INFO L93 Difference]: Finished difference Result 3110 states and 11984 transitions. [2022-11-19 07:24:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-19 07:24:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:48,039 INFO L225 Difference]: With dead ends: 3110 [2022-11-19 07:24:48,039 INFO L226 Difference]: Without dead ends: 2594 [2022-11-19 07:24:48,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:48,040 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:48,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 70 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:24:48,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2022-11-19 07:24:48,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2594. [2022-11-19 07:24:48,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2594 states, 2593 states have (on average 3.7011183956806786) internal successors, (9597), 2593 states have internal predecessors, (9597), 0 states have call successors, (0), 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-19 07:24:48,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2594 states to 2594 states and 9597 transitions. [2022-11-19 07:24:48,135 INFO L78 Accepts]: Start accepts. Automaton has 2594 states and 9597 transitions. Word has length 12 [2022-11-19 07:24:48,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:48,136 INFO L495 AbstractCegarLoop]: Abstraction has 2594 states and 9597 transitions. [2022-11-19 07:24:48,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2594 states and 9597 transitions. [2022-11-19 07:24:48,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:24:48,140 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:48,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:48,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-19 07:24:48,141 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:48,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:48,141 INFO L85 PathProgramCache]: Analyzing trace with hash -617489792, now seen corresponding path program 1 times [2022-11-19 07:24:48,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:48,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117515738] [2022-11-19 07:24:48,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:48,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:48,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:50,093 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-19 07:24:50,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:50,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117515738] [2022-11-19 07:24:50,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117515738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:50,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:50,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:50,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936632170] [2022-11-19 07:24:50,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:50,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:24:50,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:50,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:24:50,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:50,100 INFO L87 Difference]: Start difference. First operand 2594 states and 9597 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:50,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:50,557 INFO L93 Difference]: Finished difference Result 3192 states and 11848 transitions. [2022-11-19 07:24:50,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:50,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:24:50,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:50,581 INFO L225 Difference]: With dead ends: 3192 [2022-11-19 07:24:50,582 INFO L226 Difference]: Without dead ends: 3192 [2022-11-19 07:24:50,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:24:50,583 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 77 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:50,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 27 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:24:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3192 states. [2022-11-19 07:24:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 2730. [2022-11-19 07:24:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2730 states, 2729 states have (on average 3.7240747526566507) internal successors, (10163), 2729 states have internal predecessors, (10163), 0 states have call successors, (0), 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-19 07:24:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2730 states to 2730 states and 10163 transitions. [2022-11-19 07:24:50,742 INFO L78 Accepts]: Start accepts. Automaton has 2730 states and 10163 transitions. Word has length 15 [2022-11-19 07:24:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:50,743 INFO L495 AbstractCegarLoop]: Abstraction has 2730 states and 10163 transitions. [2022-11-19 07:24:50,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:50,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2730 states and 10163 transitions. [2022-11-19 07:24:50,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:24:50,751 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:50,751 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:50,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-19 07:24:50,751 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:50,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:50,753 INFO L85 PathProgramCache]: Analyzing trace with hash 549127190, now seen corresponding path program 1 times [2022-11-19 07:24:50,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:50,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172125455] [2022-11-19 07:24:50,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:50,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:51,054 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-19 07:24:51,055 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:51,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172125455] [2022-11-19 07:24:51,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172125455] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:51,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:51,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:24:51,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026905031] [2022-11-19 07:24:51,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:51,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:51,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:51,059 INFO L87 Difference]: Start difference. First operand 2730 states and 10163 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:51,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:51,239 INFO L93 Difference]: Finished difference Result 2754 states and 9394 transitions. [2022-11-19 07:24:51,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:51,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:24:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:51,253 INFO L225 Difference]: With dead ends: 2754 [2022-11-19 07:24:51,253 INFO L226 Difference]: Without dead ends: 2086 [2022-11-19 07:24:51,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:51,254 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:51,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 20 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:51,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2022-11-19 07:24:51,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 2086. [2022-11-19 07:24:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2085 states have (on average 3.3664268585131896) internal successors, (7019), 2085 states have internal predecessors, (7019), 0 states have call successors, (0), 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-19 07:24:51,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 7019 transitions. [2022-11-19 07:24:51,331 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 7019 transitions. Word has length 15 [2022-11-19 07:24:51,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:51,331 INFO L495 AbstractCegarLoop]: Abstraction has 2086 states and 7019 transitions. [2022-11-19 07:24:51,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:51,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 7019 transitions. [2022-11-19 07:24:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-19 07:24:51,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:51,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:51,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-19 07:24:51,337 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:51,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:51,337 INFO L85 PathProgramCache]: Analyzing trace with hash -1025297555, now seen corresponding path program 1 times [2022-11-19 07:24:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:51,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810255497] [2022-11-19 07:24:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:51,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:51,555 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-19 07:24:51,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:51,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810255497] [2022-11-19 07:24:51,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810255497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:51,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:51,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:51,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950275031] [2022-11-19 07:24:51,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:51,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:51,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:51,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:51,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:51,557 INFO L87 Difference]: Start difference. First operand 2086 states and 7019 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:51,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:51,739 INFO L93 Difference]: Finished difference Result 1728 states and 5415 transitions. [2022-11-19 07:24:51,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:24:51,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-19 07:24:51,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:51,746 INFO L225 Difference]: With dead ends: 1728 [2022-11-19 07:24:51,746 INFO L226 Difference]: Without dead ends: 1318 [2022-11-19 07:24:51,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:24:51,747 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 73 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:51,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 28 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:51,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-11-19 07:24:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2022-11-19 07:24:51,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 1317 states have (on average 3.0721336370539105) internal successors, (4046), 1317 states have internal predecessors, (4046), 0 states have call successors, (0), 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-19 07:24:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 4046 transitions. [2022-11-19 07:24:51,789 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 4046 transitions. Word has length 16 [2022-11-19 07:24:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:51,789 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 4046 transitions. [2022-11-19 07:24:51,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 4046 transitions. [2022-11-19 07:24:51,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-19 07:24:51,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:51,793 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-19 07:24:51,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-19 07:24:51,793 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:51,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:51,794 INFO L85 PathProgramCache]: Analyzing trace with hash 2122754105, now seen corresponding path program 1 times [2022-11-19 07:24:51,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:51,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128793706] [2022-11-19 07:24:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:51,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:52,504 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-19 07:24:52,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:52,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128793706] [2022-11-19 07:24:52,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128793706] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:52,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:52,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:24:52,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082996629] [2022-11-19 07:24:52,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:52,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:52,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:52,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:52,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:52,506 INFO L87 Difference]: Start difference. First operand 1318 states and 4046 transitions. Second operand has 4 states, 3 states have (on average 6.0) 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-19 07:24:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:52,689 INFO L93 Difference]: Finished difference Result 1895 states and 5675 transitions. [2022-11-19 07:24:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:24:52,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) 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-19 07:24:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:52,696 INFO L225 Difference]: With dead ends: 1895 [2022-11-19 07:24:52,696 INFO L226 Difference]: Without dead ends: 1319 [2022-11-19 07:24:52,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:52,697 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:52,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 10 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:52,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-11-19 07:24:52,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1219. [2022-11-19 07:24:52,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1219 states, 1218 states have (on average 2.905582922824302) internal successors, (3539), 1218 states have internal predecessors, (3539), 0 states have call successors, (0), 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-19 07:24:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1219 states to 1219 states and 3539 transitions. [2022-11-19 07:24:52,738 INFO L78 Accepts]: Start accepts. Automaton has 1219 states and 3539 transitions. Word has length 18 [2022-11-19 07:24:52,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:52,738 INFO L495 AbstractCegarLoop]: Abstraction has 1219 states and 3539 transitions. [2022-11-19 07:24:52,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) 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-19 07:24:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1219 states and 3539 transitions. [2022-11-19 07:24:52,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:24:52,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:52,743 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-19 07:24:52,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-19 07:24:52,743 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:52,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:52,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1459359821, now seen corresponding path program 1 times [2022-11-19 07:24:52,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:52,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971828678] [2022-11-19 07:24:52,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:52,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:53,009 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-19 07:24:53,009 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:53,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971828678] [2022-11-19 07:24:53,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971828678] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:53,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:53,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:53,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862047712] [2022-11-19 07:24:53,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:53,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:24:53,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:53,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:24:53,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:24:53,012 INFO L87 Difference]: Start difference. First operand 1219 states and 3539 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:53,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:53,253 INFO L93 Difference]: Finished difference Result 1066 states and 3055 transitions. [2022-11-19 07:24:53,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:24:53,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:24:53,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:53,259 INFO L225 Difference]: With dead ends: 1066 [2022-11-19 07:24:53,259 INFO L226 Difference]: Without dead ends: 940 [2022-11-19 07:24:53,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:53,260 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 94 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:53,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 35 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:53,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2022-11-19 07:24:53,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 824. [2022-11-19 07:24:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 2.88456865127582) internal successors, (2374), 823 states have internal predecessors, (2374), 0 states have call successors, (0), 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-19 07:24:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2374 transitions. [2022-11-19 07:24:53,289 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 2374 transitions. Word has length 19 [2022-11-19 07:24:53,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:53,289 INFO L495 AbstractCegarLoop]: Abstraction has 824 states and 2374 transitions. [2022-11-19 07:24:53,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:53,290 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 2374 transitions. [2022-11-19 07:24:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:24:53,292 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:53,293 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:53,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-19 07:24:53,293 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:53,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1737039104, now seen corresponding path program 1 times [2022-11-19 07:24:53,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:53,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420487165] [2022-11-19 07:24:53,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:53,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:53,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:53,671 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-19 07:24:53,671 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:53,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420487165] [2022-11-19 07:24:53,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420487165] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:53,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:53,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:24:53,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185425432] [2022-11-19 07:24:53,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:53,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:24:53,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:53,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:24:53,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:53,675 INFO L87 Difference]: Start difference. First operand 824 states and 2374 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:53,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:53,888 INFO L93 Difference]: Finished difference Result 795 states and 2315 transitions. [2022-11-19 07:24:53,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:24:53,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-19 07:24:53,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:53,891 INFO L225 Difference]: With dead ends: 795 [2022-11-19 07:24:53,892 INFO L226 Difference]: Without dead ends: 481 [2022-11-19 07:24:53,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:24:53,893 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 148 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:53,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 25 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2022-11-19 07:24:53,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 457. [2022-11-19 07:24:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 456 states have (on average 2.837719298245614) internal successors, (1294), 456 states have internal predecessors, (1294), 0 states have call successors, (0), 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-19 07:24:53,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 1294 transitions. [2022-11-19 07:24:53,913 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 1294 transitions. Word has length 22 [2022-11-19 07:24:53,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:53,914 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 1294 transitions. [2022-11-19 07:24:53,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:53,914 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 1294 transitions. [2022-11-19 07:24:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:24:53,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:53,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:53,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-19 07:24:53,919 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:53,919 INFO L85 PathProgramCache]: Analyzing trace with hash 377117563, now seen corresponding path program 1 times [2022-11-19 07:24:53,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:53,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145709] [2022-11-19 07:24:53,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:53,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:53,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:54,801 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-19 07:24:54,801 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:54,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145709] [2022-11-19 07:24:54,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145709] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:54,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:54,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:24:54,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084390526] [2022-11-19 07:24:54,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:54,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:24:54,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:54,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:24:54,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:54,804 INFO L87 Difference]: Start difference. First operand 457 states and 1294 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:55,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:55,157 INFO L93 Difference]: Finished difference Result 684 states and 1934 transitions. [2022-11-19 07:24:55,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:24:55,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 07:24:55,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:55,159 INFO L225 Difference]: With dead ends: 684 [2022-11-19 07:24:55,159 INFO L226 Difference]: Without dead ends: 237 [2022-11-19 07:24:55,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:55,160 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 43 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:55,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 15 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:24:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-19 07:24:55,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 209. [2022-11-19 07:24:55,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 208 states have (on average 2.5673076923076925) internal successors, (534), 208 states have internal predecessors, (534), 0 states have call successors, (0), 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-19 07:24:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 534 transitions. [2022-11-19 07:24:55,168 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 534 transitions. Word has length 26 [2022-11-19 07:24:55,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:55,169 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 534 transitions. [2022-11-19 07:24:55,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:55,169 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 534 transitions. [2022-11-19 07:24:55,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:24:55,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:55,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:55,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-19 07:24:55,171 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:55,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:55,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1846941859, now seen corresponding path program 2 times [2022-11-19 07:24:55,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:55,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384603613] [2022-11-19 07:24:55,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:55,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:55,422 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-19 07:24:55,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:55,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384603613] [2022-11-19 07:24:55,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384603613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:55,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:55,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:24:55,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224120217] [2022-11-19 07:24:55,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:55,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:24:55,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:55,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:24:55,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:24:55,426 INFO L87 Difference]: Start difference. First operand 209 states and 534 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:55,533 INFO L93 Difference]: Finished difference Result 322 states and 820 transitions. [2022-11-19 07:24:55,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:24:55,534 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 07:24:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:55,534 INFO L225 Difference]: With dead ends: 322 [2022-11-19 07:24:55,535 INFO L226 Difference]: Without dead ends: 135 [2022-11-19 07:24:55,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:24:55,535 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:55,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 10 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:24:55,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-19 07:24:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-11-19 07:24:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 134 states have (on average 2.373134328358209) internal successors, (318), 134 states have internal predecessors, (318), 0 states have call successors, (0), 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-19 07:24:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 318 transitions. [2022-11-19 07:24:55,540 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 318 transitions. Word has length 26 [2022-11-19 07:24:55,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:55,540 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 318 transitions. [2022-11-19 07:24:55,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 318 transitions. [2022-11-19 07:24:55,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:24:55,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:55,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:55,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-19 07:24:55,542 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:55,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:55,542 INFO L85 PathProgramCache]: Analyzing trace with hash -472347353, now seen corresponding path program 3 times [2022-11-19 07:24:55,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:55,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768493062] [2022-11-19 07:24:55,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:57,095 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-19 07:24:57,095 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:57,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768493062] [2022-11-19 07:24:57,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768493062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:57,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:57,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:24:57,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416021656] [2022-11-19 07:24:57,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:57,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:24:57,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:57,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:24:57,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:24:57,098 INFO L87 Difference]: Start difference. First operand 135 states and 318 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:57,340 INFO L93 Difference]: Finished difference Result 201 states and 480 transitions. [2022-11-19 07:24:57,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:24:57,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 07:24:57,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:57,342 INFO L225 Difference]: With dead ends: 201 [2022-11-19 07:24:57,342 INFO L226 Difference]: Without dead ends: 143 [2022-11-19 07:24:57,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:24:57,343 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 70 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:57,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 6 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-19 07:24:57,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 111. [2022-11-19 07:24:57,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 2.1636363636363636) internal successors, (238), 110 states have internal predecessors, (238), 0 states have call successors, (0), 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-19 07:24:57,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 238 transitions. [2022-11-19 07:24:57,349 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 238 transitions. Word has length 26 [2022-11-19 07:24:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:57,349 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 238 transitions. [2022-11-19 07:24:57,349 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 238 transitions. [2022-11-19 07:24:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:24:57,350 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:57,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:57,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-19 07:24:57,351 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:57,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1014686987, now seen corresponding path program 4 times [2022-11-19 07:24:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:57,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938153626] [2022-11-19 07:24:57,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:57,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:57,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:24:58,779 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-19 07:24:58,779 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:24:58,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938153626] [2022-11-19 07:24:58,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938153626] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:24:58,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:24:58,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-19 07:24:58,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491993948] [2022-11-19 07:24:58,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:24:58,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 07:24:58,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:24:58,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 07:24:58,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:24:58,781 INFO L87 Difference]: Start difference. First operand 111 states and 238 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:59,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:24:59,004 INFO L93 Difference]: Finished difference Result 149 states and 324 transitions. [2022-11-19 07:24:59,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:24:59,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-19 07:24:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:24:59,006 INFO L225 Difference]: With dead ends: 149 [2022-11-19 07:24:59,006 INFO L226 Difference]: Without dead ends: 91 [2022-11-19 07:24:59,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:24:59,007 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 50 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:24:59,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 24 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:24:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-19 07:24:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-19 07:24:59,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 2.1555555555555554) internal successors, (194), 90 states have internal predecessors, (194), 0 states have call successors, (0), 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-19 07:24:59,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 194 transitions. [2022-11-19 07:24:59,011 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 194 transitions. Word has length 26 [2022-11-19 07:24:59,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:24:59,011 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 194 transitions. [2022-11-19 07:24:59,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:24:59,011 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 194 transitions. [2022-11-19 07:24:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-19 07:24:59,012 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:24:59,012 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:59,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-19 07:24:59,013 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:24:59,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:24:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash -37034709, now seen corresponding path program 5 times [2022-11-19 07:24:59,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:24:59,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922845929] [2022-11-19 07:24:59,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:24:59,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:24:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:24:59,082 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:24:59,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:24:59,188 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-19 07:24:59,191 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:24:59,193 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-19 07:24:59,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-19 07:24:59,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-19 07:24:59,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-19 07:24:59,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-19 07:24:59,198 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-19 07:24:59,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-19 07:24:59,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-19 07:24:59,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-19 07:24:59,199 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-19 07:24:59,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-19 07:24:59,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-19 07:24:59,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-19 07:24:59,200 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-19 07:24:59,201 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-19 07:24:59,202 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-19 07:24:59,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-19 07:24:59,204 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:24:59,211 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:24:59,212 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:24:59,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:24:59 BasicIcfg [2022-11-19 07:24:59,339 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:24:59,340 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:24:59,340 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:24:59,340 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:24:59,341 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:24:33" (3/4) ... [2022-11-19 07:24:59,344 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:24:59,344 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:24:59,344 INFO L158 Benchmark]: Toolchain (without parser) took 27528.92ms. Allocated memory was 113.2MB in the beginning and 713.0MB in the end (delta: 599.8MB). Free memory was 73.4MB in the beginning and 567.5MB in the end (delta: -494.0MB). Peak memory consumption was 104.8MB. Max. memory is 16.1GB. [2022-11-19 07:24:59,345 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 113.2MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:24:59,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 723.23ms. Allocated memory is still 113.2MB. Free memory was 73.3MB in the beginning and 74.0MB in the end (delta: -742.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-19 07:24:59,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.11ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 71.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-19 07:24:59,347 INFO L158 Benchmark]: Boogie Preprocessor took 35.33ms. Allocated memory is still 113.2MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:24:59,347 INFO L158 Benchmark]: RCFGBuilder took 916.45ms. Allocated memory is still 113.2MB. Free memory was 69.1MB in the beginning and 75.2MB in the end (delta: -6.1MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2022-11-19 07:24:59,347 INFO L158 Benchmark]: TraceAbstraction took 25787.29ms. Allocated memory was 113.2MB in the beginning and 713.0MB in the end (delta: 599.8MB). Free memory was 74.2MB in the beginning and 567.5MB in the end (delta: -493.3MB). Peak memory consumption was 524.9MB. Max. memory is 16.1GB. [2022-11-19 07:24:59,348 INFO L158 Benchmark]: Witness Printer took 4.20ms. Allocated memory is still 713.0MB. Free memory is still 567.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:24:59,350 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.30ms. Allocated memory is still 113.2MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 723.23ms. Allocated memory is still 113.2MB. Free memory was 73.3MB in the beginning and 74.0MB in the end (delta: -742.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.11ms. Allocated memory is still 113.2MB. Free memory was 74.0MB in the beginning and 71.2MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.33ms. Allocated memory is still 113.2MB. Free memory was 71.2MB in the beginning and 69.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 916.45ms. Allocated memory is still 113.2MB. Free memory was 69.1MB in the beginning and 75.2MB in the end (delta: -6.1MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25787.29ms. Allocated memory was 113.2MB in the beginning and 713.0MB in the end (delta: 599.8MB). Free memory was 74.2MB in the beginning and 567.5MB in the end (delta: -493.3MB). Peak memory consumption was 524.9MB. Max. memory is 16.1GB. * Witness Printer took 4.20ms. Allocated memory is still 713.0MB. Free memory is still 567.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.0s, 157 PlacesBefore, 55 PlacesAfterwards, 146 TransitionsBefore, 43 TransitionsAfterwards, 3434 CoEnabledTransitionPairs, 7 FixpointIterations, 57 TrivialSequentialCompositions, 79 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 145 TotalNumberOfCompositions, 9510 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4724, independent: 4508, independent conditional: 0, independent unconditional: 4508, dependent: 216, dependent conditional: 0, dependent unconditional: 216, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2576, independent: 2499, independent conditional: 0, independent unconditional: 2499, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2576, independent: 2468, independent conditional: 0, independent unconditional: 2468, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 108, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 646, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 576, dependent conditional: 0, dependent unconditional: 576, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4724, independent: 2009, independent conditional: 0, independent unconditional: 2009, dependent: 139, dependent conditional: 0, dependent unconditional: 139, unknown: 2576, unknown conditional: 0, unknown unconditional: 2576] , Statistics on independence cache: Total cache size (in pairs): 345, Positive cache size: 318, Positive conditional cache size: 0, Positive unconditional cache size: 318, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L737] 0 int y$w_buff0; [L739] 0 int y$w_buff1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L724] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd4; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$read_delayed; [L716] 0 int a = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L710] 0 int __unbuffered_cnt = 0; [L723] 0 _Bool y$flush_delayed; [L740] 0 _Bool y$w_buff1_used; [L718] 0 _Bool main$tmp_guard1; [L717] 0 _Bool main$tmp_guard0; [L714] 0 int __unbuffered_p3_EAX = 0; [L736] 0 int *y$read_delayed_var; [L738] 0 _Bool y$w_buff0_used; [L720] 0 int x = 0; [L730] 0 _Bool y$r_buff1_thd0; [L722] 0 int y = 0; [L732] 0 _Bool y$r_buff1_thd2; [L742] 0 int z = 0; [L731] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd4; [L733] 0 _Bool y$r_buff1_thd3; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=-3, t1433={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1434, ((void *)0), P1, ((void *)0))=-2, t1433={5:0}, t1434={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=-1, t1433={5:0}, t1434={6:0}, t1435={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1436, ((void *)0), P3, ((void *)0))=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L763] 2 x = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L769] 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) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 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 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 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 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={5:0}, t1434={6:0}, t1435={7:0}, t1436={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 842]: 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: 844]: 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: 848]: 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 9 procedures, 181 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 25.5s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 790 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 790 mSDsluCounter, 298 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 192 mSDsCounter, 129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1553 IncrementalHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 129 mSolverCounterUnsat, 106 mSDtfsCounter, 1553 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4380occurred in iteration=0, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2884 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 278 NumberOfCodeBlocks, 278 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 2621 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-19 07:24:59,373 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS --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 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 --- 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-8393723 [2022-11-19 07:25:01,835 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:25:01,838 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:25:01,862 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:25:01,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:25:01,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:25:01,872 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:25:01,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:25:01,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:25:01,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:25:01,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:25:01,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:25:01,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:25:01,891 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:25:01,892 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:25:01,895 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:25:01,897 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:25:01,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:25:01,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:25:01,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:25:01,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:25:01,919 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:25:01,920 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:25:01,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:25:01,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:25:01,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:25:01,932 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:25:01,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:25:01,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:25:01,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:25:01,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:25:01,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:25:01,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:25:01,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:25:01,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:25:01,945 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:25:01,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:25:01,946 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:25:01,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:25:01,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:25:01,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:25:01,953 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-19 07:25:01,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:25:01,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:25:01,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:25:01,991 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:25:01,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:25:01,992 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:25:01,992 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:25:01,993 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:25:01,993 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:25:02,005 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:25:02,005 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:25:02,005 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:25:02,006 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-19 07:25:02,006 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-19 07:25:02,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:25:02,007 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:25:02,007 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:25:02,011 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:25:02,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:25:02,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:25:02,012 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-19 07:25:02,013 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-19 07:25:02,013 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-19 07:25:02,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:25:02,013 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-19 07:25:02,014 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-19 07:25:02,014 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-19 07:25:02,014 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:25:02,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:25:02,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:25:02,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-19 07:25:02,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:25:02,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:25:02,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:25:02,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:25:02,017 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-19 07:25:02,018 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-19 07:25:02,018 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:25:02,018 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-19 07:25:02,019 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_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS 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 -> 9a8131f8693d82039b4018f716a17d0a3e1038ace11c7bb21b12bc911efac3c1 [2022-11-19 07:25:02,396 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:25:02,419 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:25:02,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:25:02,423 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:25:02,424 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:25:02,426 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2022-11-19 07:25:02,518 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data/f277bbbb9/84819a0bf6e24c5aa98a1d1b705adbe9/FLAG0e675feb3 [2022-11-19 07:25:03,142 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:25:03,144 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i [2022-11-19 07:25:03,159 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data/f277bbbb9/84819a0bf6e24c5aa98a1d1b705adbe9/FLAG0e675feb3 [2022-11-19 07:25:03,375 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/data/f277bbbb9/84819a0bf6e24c5aa98a1d1b705adbe9 [2022-11-19 07:25:03,378 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:25:03,381 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:25:03,385 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:25:03,386 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:25:03,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:25:03,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:03" (1/1) ... [2022-11-19 07:25:03,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6deeb97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:03, skipping insertion in model container [2022-11-19 07:25:03,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:25:03" (1/1) ... [2022-11-19 07:25:03,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:25:03,464 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:25:03,684 WARN L234 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_e34b69da-5864-4d2e-b093-59ac073e1d08/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2022-11-19 07:25:03,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:25:03,990 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:25:04,013 WARN L234 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_e34b69da-5864-4d2e-b093-59ac073e1d08/sv-benchmarks/c/pthread-wmm/mix053_tso.oepc.i[949,962] [2022-11-19 07:25:04,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:25:04,141 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:25:04,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04 WrapperNode [2022-11-19 07:25:04,142 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:25:04,143 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:25:04,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:25:04,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:25:04,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,228 INFO L138 Inliner]: procedures = 180, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2022-11-19 07:25:04,228 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:25:04,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:25:04,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:25:04,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:25:04,239 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,239 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,242 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,243 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,251 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,255 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:25:04,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:25:04,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:25:04,262 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:25:04,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (1/1) ... [2022-11-19 07:25:04,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:25:04,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:25:04,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:25:04,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:25:04,357 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-19 07:25:04,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:25:04,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:25:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:25:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-19 07:25:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-19 07:25:04,358 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-19 07:25:04,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-19 07:25:04,359 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-19 07:25:04,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-19 07:25:04,359 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-19 07:25:04,359 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-19 07:25:04,360 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-19 07:25:04,360 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-19 07:25:04,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-19 07:25:04,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:25:04,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:25:04,362 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-19 07:25:04,535 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:25:04,537 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:25:05,164 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:25:05,315 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:25:05,319 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-19 07:25:05,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:05 BoogieIcfgContainer [2022-11-19 07:25:05,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:25:05,325 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:25:05,325 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:25:05,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:25:05,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:25:03" (1/3) ... [2022-11-19 07:25:05,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724728d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:05, skipping insertion in model container [2022-11-19 07:25:05,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:25:04" (2/3) ... [2022-11-19 07:25:05,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@724728d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:25:05, skipping insertion in model container [2022-11-19 07:25:05,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:05" (3/3) ... [2022-11-19 07:25:05,332 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_tso.oepc.i [2022-11-19 07:25:05,351 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:25:05,351 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-11-19 07:25:05,351 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-19 07:25:05,459 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-19 07:25:05,516 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-19 07:25:05,532 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 147 transitions, 314 flow [2022-11-19 07:25:05,535 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 147 transitions, 314 flow [2022-11-19 07:25:05,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 147 transitions, 314 flow [2022-11-19 07:25:05,626 INFO L130 PetriNetUnfolder]: 2/143 cut-off events. [2022-11-19 07:25:05,626 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-19 07:25:05,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 143 events. 2/143 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 99 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2022-11-19 07:25:05,635 INFO L119 LiptonReduction]: Number of co-enabled transitions 3434 [2022-11-19 07:25:17,164 INFO L134 LiptonReduction]: Checked pairs total: 9430 [2022-11-19 07:25:17,165 INFO L136 LiptonReduction]: Total number of compositions: 144 [2022-11-19 07:25:17,173 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 55 places, 43 transitions, 106 flow [2022-11-19 07:25:17,442 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4380 states, 4365 states have (on average 4.052691867124857) internal successors, (17690), 4379 states have internal predecessors, (17690), 0 states have call successors, (0), 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-19 07:25:17,461 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:25:17,468 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;@61eb2de8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:25:17,468 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-11-19 07:25:17,483 INFO L276 IsEmpty]: Start isEmpty. Operand has 4380 states, 4365 states have (on average 4.052691867124857) internal successors, (17690), 4379 states have internal predecessors, (17690), 0 states have call successors, (0), 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-19 07:25:17,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-19 07:25:17,489 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:17,489 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-19 07:25:17,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:17,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash 612, now seen corresponding path program 1 times [2022-11-19 07:25:17,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:17,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241093181] [2022-11-19 07:25:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:17,510 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-19 07:25:17,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:17,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:17,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:17,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:17,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-19 07:25:17,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:17,650 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-19 07:25:17,651 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:17,651 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:17,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241093181] [2022-11-19 07:25:17,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241093181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:17,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:17,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-19 07:25:17,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229286644] [2022-11-19 07:25:17,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:17,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-19 07:25:17,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:17,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-19 07:25:17,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-19 07:25:17,699 INFO L87 Difference]: Start difference. First operand has 4380 states, 4365 states have (on average 4.052691867124857) internal successors, (17690), 4379 states have internal predecessors, (17690), 0 states have call successors, (0), 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-19 07:25:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:18,029 INFO L93 Difference]: Finished difference Result 4090 states and 16160 transitions. [2022-11-19 07:25:18,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-19 07:25:18,032 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-19 07:25:18,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:18,089 INFO L225 Difference]: With dead ends: 4090 [2022-11-19 07:25:18,089 INFO L226 Difference]: Without dead ends: 4090 [2022-11-19 07:25:18,091 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-19 07:25:18,094 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:18,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:25:18,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4090 states. [2022-11-19 07:25:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4090 to 4090. [2022-11-19 07:25:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4090 states, 4085 states have (on average 3.95593635250918) internal successors, (16160), 4089 states have internal predecessors, (16160), 0 states have call successors, (0), 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-19 07:25:18,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4090 states to 4090 states and 16160 transitions. [2022-11-19 07:25:18,471 INFO L78 Accepts]: Start accepts. Automaton has 4090 states and 16160 transitions. Word has length 1 [2022-11-19 07:25:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:18,472 INFO L495 AbstractCegarLoop]: Abstraction has 4090 states and 16160 transitions. [2022-11-19 07:25:18,472 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-19 07:25:18,472 INFO L276 IsEmpty]: Start isEmpty. Operand 4090 states and 16160 transitions. [2022-11-19 07:25:18,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-19 07:25:18,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:18,473 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:18,490 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:18,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:18,685 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:18,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:18,686 INFO L85 PathProgramCache]: Analyzing trace with hash -495025216, now seen corresponding path program 1 times [2022-11-19 07:25:18,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:18,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [565218705] [2022-11-19 07:25:18,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:18,687 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-19 07:25:18,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:18,689 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:18,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:18,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:25:18,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:18,849 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-19 07:25:18,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:18,850 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:18,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [565218705] [2022-11-19 07:25:18,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [565218705] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:18,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:18,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-19 07:25:18,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947362595] [2022-11-19 07:25:18,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:18,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:25:18,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:18,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:25:18,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:25:18,854 INFO L87 Difference]: Start difference. First operand 4090 states and 16160 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-19 07:25:19,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:19,047 INFO L93 Difference]: Finished difference Result 3350 states and 13073 transitions. [2022-11-19 07:25:19,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:25:19,048 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-11-19 07:25:19,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:19,075 INFO L225 Difference]: With dead ends: 3350 [2022-11-19 07:25:19,076 INFO L226 Difference]: Without dead ends: 3250 [2022-11-19 07:25:19,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-19 07:25:19,077 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 15 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:19,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:25:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2022-11-19 07:25:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2022-11-19 07:25:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3248 states have (on average 3.9217980295566504) internal successors, (12738), 3249 states have internal predecessors, (12738), 0 states have call successors, (0), 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-19 07:25:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2022-11-19 07:25:19,359 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 7 [2022-11-19 07:25:19,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:19,360 INFO L495 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2022-11-19 07:25:19,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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-19 07:25:19,366 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2022-11-19 07:25:19,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-19 07:25:19,392 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:19,393 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:19,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:19,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:19,605 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:19,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:19,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1807710338, now seen corresponding path program 1 times [2022-11-19 07:25:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:19,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270340632] [2022-11-19 07:25:19,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:19,608 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-19 07:25:19,608 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:19,609 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:19,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:19,851 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-19 07:25:19,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:19,915 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-19 07:25:19,915 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:19,916 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:19,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270340632] [2022-11-19 07:25:19,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270340632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:19,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:19,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:25:19,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514413505] [2022-11-19 07:25:19,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:19,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:25:19,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:19,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:25:19,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:25:19,919 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-19 07:25:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:20,177 INFO L93 Difference]: Finished difference Result 2790 states and 9705 transitions. [2022-11-19 07:25:20,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:25:20,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-19 07:25:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:20,212 INFO L225 Difference]: With dead ends: 2790 [2022-11-19 07:25:20,213 INFO L226 Difference]: Without dead ends: 2290 [2022-11-19 07:25:20,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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-19 07:25:20,214 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 42 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:20,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 20 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:20,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2022-11-19 07:25:20,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2290. [2022-11-19 07:25:20,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2290 states, 2288 states have (on average 3.4694055944055946) internal successors, (7938), 2289 states have internal predecessors, (7938), 0 states have call successors, (0), 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-19 07:25:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 7938 transitions. [2022-11-19 07:25:20,461 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 7938 transitions. Word has length 12 [2022-11-19 07:25:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:20,462 INFO L495 AbstractCegarLoop]: Abstraction has 2290 states and 7938 transitions. [2022-11-19 07:25:20,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 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-19 07:25:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 7938 transitions. [2022-11-19 07:25:20,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-19 07:25:20,466 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:20,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:20,481 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:20,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:20,679 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:20,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:20,680 INFO L85 PathProgramCache]: Analyzing trace with hash 364223277, now seen corresponding path program 1 times [2022-11-19 07:25:20,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:20,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557237494] [2022-11-19 07:25:20,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:20,682 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-19 07:25:20,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:20,683 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:20,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:20,816 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:25:20,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:20,890 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-19 07:25:20,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:20,891 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:20,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557237494] [2022-11-19 07:25:20,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557237494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:20,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:20,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:20,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253625047] [2022-11-19 07:25:20,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:20,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:25:20,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:20,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:25:20,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:25:20,896 INFO L87 Difference]: Start difference. First operand 2290 states and 7938 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:21,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:21,211 INFO L93 Difference]: Finished difference Result 1558 states and 4793 transitions. [2022-11-19 07:25:21,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:25:21,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-19 07:25:21,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:21,221 INFO L225 Difference]: With dead ends: 1558 [2022-11-19 07:25:21,222 INFO L226 Difference]: Without dead ends: 1250 [2022-11-19 07:25:21,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:21,227 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 57 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:21,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 36 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:25:21,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2022-11-19 07:25:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1250. [2022-11-19 07:25:21,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1248 states have (on average 3.02724358974359) internal successors, (3778), 1249 states have internal predecessors, (3778), 0 states have call successors, (0), 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-19 07:25:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 3778 transitions. [2022-11-19 07:25:21,344 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 3778 transitions. Word has length 15 [2022-11-19 07:25:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:21,344 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 3778 transitions. [2022-11-19 07:25:21,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:21,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 3778 transitions. [2022-11-19 07:25:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-19 07:25:21,347 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:21,347 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-19 07:25:21,364 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:21,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:21,560 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:21,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:21,560 INFO L85 PathProgramCache]: Analyzing trace with hash -434153531, now seen corresponding path program 1 times [2022-11-19 07:25:21,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:21,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004525820] [2022-11-19 07:25:21,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:21,561 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-19 07:25:21,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:21,562 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:21,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:21,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 07:25:21,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:21,790 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-19 07:25:21,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:21,791 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:21,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004525820] [2022-11-19 07:25:21,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004525820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:21,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:21,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:25:21,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826588024] [2022-11-19 07:25:21,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:21,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:25:21,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:21,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:25:21,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:21,794 INFO L87 Difference]: Start difference. First operand 1250 states and 3778 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:22,154 INFO L93 Difference]: Finished difference Result 930 states and 2785 transitions. [2022-11-19 07:25:22,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:25:22,155 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-19 07:25:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:22,160 INFO L225 Difference]: With dead ends: 930 [2022-11-19 07:25:22,160 INFO L226 Difference]: Without dead ends: 830 [2022-11-19 07:25:22,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:25:22,161 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 69 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:22,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 64 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-19 07:25:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2022-11-19 07:25:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2022-11-19 07:25:22,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 3.0410628019323673) internal successors, (2518), 829 states have internal predecessors, (2518), 0 states have call successors, (0), 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-19 07:25:22,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2518 transitions. [2022-11-19 07:25:22,206 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2518 transitions. Word has length 19 [2022-11-19 07:25:22,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:22,206 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 2518 transitions. [2022-11-19 07:25:22,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-19 07:25:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2518 transitions. [2022-11-19 07:25:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:25:22,209 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:22,210 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-19 07:25:22,223 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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)] Ended with exit code 0 [2022-11-19 07:25:22,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:22,428 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:22,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:22,428 INFO L85 PathProgramCache]: Analyzing trace with hash 853697696, now seen corresponding path program 1 times [2022-11-19 07:25:22,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:22,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113896538] [2022-11-19 07:25:22,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:22,429 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-19 07:25:22,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:22,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:22,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:22,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 07:25:22,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:22,675 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-19 07:25:22,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:22,675 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:22,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113896538] [2022-11-19 07:25:22,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113896538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:22,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:22,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:25:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239632617] [2022-11-19 07:25:22,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:22,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:25:22,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:22,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:25:22,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:25:22,678 INFO L87 Difference]: Start difference. First operand 830 states and 2518 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) 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-19 07:25:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:23,182 INFO L93 Difference]: Finished difference Result 771 states and 2398 transitions. [2022-11-19 07:25:23,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:25:23,183 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) 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-19 07:25:23,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:23,188 INFO L225 Difference]: With dead ends: 771 [2022-11-19 07:25:23,188 INFO L226 Difference]: Without dead ends: 755 [2022-11-19 07:25:23,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:25:23,189 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:23,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 96 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:25:23,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2022-11-19 07:25:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 755. [2022-11-19 07:25:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 753 states have (on average 3.144754316069057) internal successors, (2368), 754 states have internal predecessors, (2368), 0 states have call successors, (0), 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-19 07:25:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 2368 transitions. [2022-11-19 07:25:23,217 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 2368 transitions. Word has length 23 [2022-11-19 07:25:23,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:23,218 INFO L495 AbstractCegarLoop]: Abstraction has 755 states and 2368 transitions. [2022-11-19 07:25:23,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) 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-19 07:25:23,218 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 2368 transitions. [2022-11-19 07:25:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:25:23,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:23,221 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:23,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:23,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:23,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:23,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:23,440 INFO L85 PathProgramCache]: Analyzing trace with hash 470204171, now seen corresponding path program 1 times [2022-11-19 07:25:23,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:23,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175709014] [2022-11-19 07:25:23,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:23,442 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-19 07:25:23,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:23,468 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:23,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:23,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:25:23,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:24,057 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-19 07:25:24,057 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:24,058 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:24,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175709014] [2022-11-19 07:25:24,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175709014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:24,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:24,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:24,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865665701] [2022-11-19 07:25:24,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:24,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-19 07:25:24,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:24,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-19 07:25:24,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:25:24,060 INFO L87 Difference]: Start difference. First operand 755 states and 2368 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:24,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:24,298 INFO L93 Difference]: Finished difference Result 984 states and 3032 transitions. [2022-11-19 07:25:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:25:24,299 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-19 07:25:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:24,305 INFO L225 Difference]: With dead ends: 984 [2022-11-19 07:25:24,306 INFO L226 Difference]: Without dead ends: 984 [2022-11-19 07:25:24,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:25:24,307 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 27 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:24,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 25 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2022-11-19 07:25:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 983. [2022-11-19 07:25:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 983 states, 981 states have (on average 3.09072375127421) internal successors, (3032), 982 states have internal predecessors, (3032), 0 states have call successors, (0), 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-19 07:25:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 3032 transitions. [2022-11-19 07:25:24,351 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 3032 transitions. Word has length 27 [2022-11-19 07:25:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:24,352 INFO L495 AbstractCegarLoop]: Abstraction has 983 states and 3032 transitions. [2022-11-19 07:25:24,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 3032 transitions. [2022-11-19 07:25:24,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:25:24,356 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:24,356 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:24,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:24,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:24,569 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:24,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:24,570 INFO L85 PathProgramCache]: Analyzing trace with hash 470204211, now seen corresponding path program 1 times [2022-11-19 07:25:24,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:24,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012094580] [2022-11-19 07:25:24,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:25:24,571 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-19 07:25:24,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:24,573 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:24,612 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:25:24,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-19 07:25:24,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:25,524 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-19 07:25:25,525 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:25,525 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:25,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012094580] [2022-11-19 07:25:25,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012094580] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:25,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:25,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:25,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811232981] [2022-11-19 07:25:25,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:25,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:25:25,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:25,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:25:25,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:25,527 INFO L87 Difference]: Start difference. First operand 983 states and 3032 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:25,699 INFO L93 Difference]: Finished difference Result 1556 states and 4836 transitions. [2022-11-19 07:25:25,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:25:25,700 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-19 07:25:25,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:25,705 INFO L225 Difference]: With dead ends: 1556 [2022-11-19 07:25:25,705 INFO L226 Difference]: Without dead ends: 1133 [2022-11-19 07:25:25,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:25,706 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:25,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 41 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2022-11-19 07:25:25,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-11-19 07:25:25,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 923. [2022-11-19 07:25:25,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 923 states, 921 states have (on average 3.044516829533116) internal successors, (2804), 922 states have internal predecessors, (2804), 0 states have call successors, (0), 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-19 07:25:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 2804 transitions. [2022-11-19 07:25:25,739 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 2804 transitions. Word has length 27 [2022-11-19 07:25:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:25,740 INFO L495 AbstractCegarLoop]: Abstraction has 923 states and 2804 transitions. [2022-11-19 07:25:25,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 2804 transitions. [2022-11-19 07:25:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:25:25,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:25,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:25,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:25,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:25,959 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:25,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1650808453, now seen corresponding path program 2 times [2022-11-19 07:25:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:25,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670495466] [2022-11-19 07:25:25,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:25:25,960 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-19 07:25:25,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:25,961 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:25,967 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:26,242 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:25:26,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:26,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 07:25:26,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:26,925 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-19 07:25:26,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:26,925 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:26,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670495466] [2022-11-19 07:25:26,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670495466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:26,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:26,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:26,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640774711] [2022-11-19 07:25:26,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:26,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:25:26,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:26,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:25:26,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:26,927 INFO L87 Difference]: Start difference. First operand 923 states and 2804 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:27,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:27,022 INFO L93 Difference]: Finished difference Result 1558 states and 4794 transitions. [2022-11-19 07:25:27,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:25:27,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-19 07:25:27,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:27,029 INFO L225 Difference]: With dead ends: 1558 [2022-11-19 07:25:27,030 INFO L226 Difference]: Without dead ends: 1102 [2022-11-19 07:25:27,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:27,031 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:27,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-11-19 07:25:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2022-11-19 07:25:27,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 950. [2022-11-19 07:25:27,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 948 states have (on average 3.0158227848101267) internal successors, (2859), 949 states have internal predecessors, (2859), 0 states have call successors, (0), 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-19 07:25:27,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 2859 transitions. [2022-11-19 07:25:27,072 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 2859 transitions. Word has length 27 [2022-11-19 07:25:27,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:27,073 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 2859 transitions. [2022-11-19 07:25:27,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 2859 transitions. [2022-11-19 07:25:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:25:27,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:27,077 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:27,096 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:27,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:27,296 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:27,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -240544937, now seen corresponding path program 3 times [2022-11-19 07:25:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:27,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209475003] [2022-11-19 07:25:27,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:25:27,298 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-19 07:25:27,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:27,299 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:27,304 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (11)] Waiting until timeout for monitored process [2022-11-19 07:25:27,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:25:27,566 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:27,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-19 07:25:27,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:28,229 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-19 07:25:28,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:28,229 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:28,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [209475003] [2022-11-19 07:25:28,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [209475003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:28,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:28,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:28,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815639200] [2022-11-19 07:25:28,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:28,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:25:28,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:28,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:25:28,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:28,231 INFO L87 Difference]: Start difference. First operand 950 states and 2859 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:28,436 INFO L93 Difference]: Finished difference Result 1523 states and 4663 transitions. [2022-11-19 07:25:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:25:28,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-19 07:25:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:28,441 INFO L225 Difference]: With dead ends: 1523 [2022-11-19 07:25:28,442 INFO L226 Difference]: Without dead ends: 1098 [2022-11-19 07:25:28,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:28,443 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:28,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 41 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 38 Unchecked, 0.2s Time] [2022-11-19 07:25:28,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2022-11-19 07:25:28,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 888. [2022-11-19 07:25:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 886 states have (on average 3.0428893905191874) internal successors, (2696), 887 states have internal predecessors, (2696), 0 states have call successors, (0), 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-19 07:25:28,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 2696 transitions. [2022-11-19 07:25:28,473 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 2696 transitions. Word has length 27 [2022-11-19 07:25:28,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:28,473 INFO L495 AbstractCegarLoop]: Abstraction has 888 states and 2696 transitions. [2022-11-19 07:25:28,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 2696 transitions. [2022-11-19 07:25:28,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:25:28,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:28,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:28,492 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (11)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:28,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:28,691 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1927793845, now seen corresponding path program 4 times [2022-11-19 07:25:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:28,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816103447] [2022-11-19 07:25:28,693 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:25:28,693 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-19 07:25:28,693 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:28,694 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:28,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (12)] Waiting until timeout for monitored process [2022-11-19 07:25:28,930 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:25:28,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:28,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 07:25:28,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:29,574 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-19 07:25:29,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:29,574 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:29,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816103447] [2022-11-19 07:25:29,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816103447] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:29,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:29,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:29,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768040489] [2022-11-19 07:25:29,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:29,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:25:29,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:29,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:25:29,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:29,576 INFO L87 Difference]: Start difference. First operand 888 states and 2696 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:29,673 INFO L93 Difference]: Finished difference Result 1195 states and 3576 transitions. [2022-11-19 07:25:29,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:25:29,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-19 07:25:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:29,679 INFO L225 Difference]: With dead ends: 1195 [2022-11-19 07:25:29,679 INFO L226 Difference]: Without dead ends: 1030 [2022-11-19 07:25:29,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:29,680 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:29,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-11-19 07:25:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2022-11-19 07:25:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 878. [2022-11-19 07:25:29,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 876 states have (on average 3.057077625570776) internal successors, (2678), 877 states have internal predecessors, (2678), 0 states have call successors, (0), 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-19 07:25:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 2678 transitions. [2022-11-19 07:25:29,712 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 2678 transitions. Word has length 27 [2022-11-19 07:25:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:29,712 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 2678 transitions. [2022-11-19 07:25:29,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:29,713 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 2678 transitions. [2022-11-19 07:25:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:25:29,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:29,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:29,729 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (12)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:29,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:29,929 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:29,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:29,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1234985193, now seen corresponding path program 5 times [2022-11-19 07:25:29,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:29,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769177423] [2022-11-19 07:25:29,930 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-19 07:25:29,930 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-19 07:25:29,930 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:29,931 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:29,932 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (13)] Waiting until timeout for monitored process [2022-11-19 07:25:30,176 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:25:30,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:30,183 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-19 07:25:30,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:30,832 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-19 07:25:30,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:30,833 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:30,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769177423] [2022-11-19 07:25:30,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769177423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:30,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:30,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-19 07:25:30,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192164370] [2022-11-19 07:25:30,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:30,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:25:30,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:30,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:25:30,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:30,834 INFO L87 Difference]: Start difference. First operand 878 states and 2678 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:30,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:30,917 INFO L93 Difference]: Finished difference Result 1710 states and 5242 transitions. [2022-11-19 07:25:30,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 07:25:30,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-19 07:25:30,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:30,924 INFO L225 Difference]: With dead ends: 1710 [2022-11-19 07:25:30,924 INFO L226 Difference]: Without dead ends: 1347 [2022-11-19 07:25:30,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:25:30,925 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:30,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-11-19 07:25:30,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2022-11-19 07:25:30,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1197. [2022-11-19 07:25:30,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1197 states, 1195 states have (on average 3.001673640167364) internal successors, (3587), 1196 states have internal predecessors, (3587), 0 states have call successors, (0), 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-19 07:25:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 3587 transitions. [2022-11-19 07:25:30,989 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 3587 transitions. Word has length 27 [2022-11-19 07:25:30,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:30,990 INFO L495 AbstractCegarLoop]: Abstraction has 1197 states and 3587 transitions. [2022-11-19 07:25:30,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 3587 transitions. [2022-11-19 07:25:30,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:25:30,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:30,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:31,008 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (13)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:31,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:31,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:31,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:31,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1645777163, now seen corresponding path program 2 times [2022-11-19 07:25:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:31,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731743167] [2022-11-19 07:25:31,208 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-19 07:25:31,209 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-19 07:25:31,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:31,210 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:31,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (14)] Waiting until timeout for monitored process [2022-11-19 07:25:31,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-19 07:25:31,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:31,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-19 07:25:31,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:31,616 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-19 07:25:31,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:31,617 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:31,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731743167] [2022-11-19 07:25:31,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731743167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:31,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:31,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:25:31,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825462271] [2022-11-19 07:25:31,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:31,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 07:25:31,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:31,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 07:25:31,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:25:31,619 INFO L87 Difference]: Start difference. First operand 1197 states and 3587 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:31,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:31,838 INFO L93 Difference]: Finished difference Result 1675 states and 4870 transitions. [2022-11-19 07:25:31,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:25:31,838 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-19 07:25:31,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:31,844 INFO L225 Difference]: With dead ends: 1675 [2022-11-19 07:25:31,844 INFO L226 Difference]: Without dead ends: 1592 [2022-11-19 07:25:31,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:25:31,845 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:31,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 20 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:31,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2022-11-19 07:25:31,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1153. [2022-11-19 07:25:31,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 1151 states have (on average 2.9843614248479584) internal successors, (3435), 1152 states have internal predecessors, (3435), 0 states have call successors, (0), 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-19 07:25:31,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 3435 transitions. [2022-11-19 07:25:31,885 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 3435 transitions. Word has length 27 [2022-11-19 07:25:31,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:31,886 INFO L495 AbstractCegarLoop]: Abstraction has 1153 states and 3435 transitions. [2022-11-19 07:25:31,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:31,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 3435 transitions. [2022-11-19 07:25:31,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:25:31,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:31,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:31,907 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (14)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:32,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:32,103 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:32,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:32,103 INFO L85 PathProgramCache]: Analyzing trace with hash 605915723, now seen corresponding path program 3 times [2022-11-19 07:25:32,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:32,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997987906] [2022-11-19 07:25:32,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:25:32,104 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-19 07:25:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:32,105 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:32,106 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (15)] Waiting until timeout for monitored process [2022-11-19 07:25:32,252 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:25:32,252 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:25:32,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-19 07:25:32,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:25:32,644 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-19 07:25:32,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 07:25:32,645 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-19 07:25:32,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997987906] [2022-11-19 07:25:32,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997987906] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:25:32,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:25:32,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-19 07:25:32,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589066096] [2022-11-19 07:25:32,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:25:32,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 07:25:32,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-19 07:25:32,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 07:25:32,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:25:32,647 INFO L87 Difference]: Start difference. First operand 1153 states and 3435 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:32,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:25:32,881 INFO L93 Difference]: Finished difference Result 1457 states and 4215 transitions. [2022-11-19 07:25:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-19 07:25:32,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-19 07:25:32,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:25:32,887 INFO L225 Difference]: With dead ends: 1457 [2022-11-19 07:25:32,887 INFO L226 Difference]: Without dead ends: 1336 [2022-11-19 07:25:32,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-19 07:25:32,888 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 66 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:25:32,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 20 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:25:32,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2022-11-19 07:25:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1143. [2022-11-19 07:25:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1143 states, 1141 states have (on average 2.98510078878177) internal successors, (3406), 1142 states have internal predecessors, (3406), 0 states have call successors, (0), 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-19 07:25:32,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 3406 transitions. [2022-11-19 07:25:32,927 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 3406 transitions. Word has length 27 [2022-11-19 07:25:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:25:32,927 INFO L495 AbstractCegarLoop]: Abstraction has 1143 states and 3406 transitions. [2022-11-19 07:25:32,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-19 07:25:32,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 3406 transitions. [2022-11-19 07:25:32,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:25:32,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:25:32,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:32,950 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (15)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:33,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:33,145 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2022-11-19 07:25:33,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:25:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1492385043, now seen corresponding path program 4 times [2022-11-19 07:25:33,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-19 07:25:33,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962952286] [2022-11-19 07:25:33,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 07:25:33,146 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-19 07:25:33,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/mathsat [2022-11-19 07:25:33,147 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:33,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (16)] Waiting until timeout for monitored process [2022-11-19 07:25:33,341 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 07:25:33,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-19 07:25:33,341 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-19 07:25:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-19 07:25:33,498 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-19 07:25:33,499 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-19 07:25:33,500 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2022-11-19 07:25:33,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2022-11-19 07:25:33,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2022-11-19 07:25:33,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2022-11-19 07:25:33,502 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2022-11-19 07:25:33,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2022-11-19 07:25:33,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2022-11-19 07:25:33,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2022-11-19 07:25:33,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2022-11-19 07:25:33,503 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2022-11-19 07:25:33,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2022-11-19 07:25:33,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2022-11-19 07:25:33,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2022-11-19 07:25:33,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2022-11-19 07:25:33,504 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2022-11-19 07:25:33,505 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2022-11-19 07:25:33,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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 (16)] Forceful destruction successful, exit code 0 [2022-11-19 07:25:33,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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-19 07:25:33,720 INFO L444 BasicCegarLoop]: Path program histogram: [5, 4, 1, 1, 1, 1, 1, 1] [2022-11-19 07:25:33,725 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-19 07:25:33,725 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:25:33,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 07:25:33 BasicIcfg [2022-11-19 07:25:33,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 07:25:33,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 07:25:33,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 07:25:33,864 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 07:25:33,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:25:05" (3/4) ... [2022-11-19 07:25:33,868 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-19 07:25:33,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 07:25:33,869 INFO L158 Benchmark]: Toolchain (without parser) took 30487.89ms. Allocated memory was 60.8MB in the beginning and 381.7MB in the end (delta: 320.9MB). Free memory was 39.8MB in the beginning and 299.3MB in the end (delta: -259.5MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2022-11-19 07:25:33,872 INFO L158 Benchmark]: CDTParser took 0.59ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:33,872 INFO L158 Benchmark]: CACSL2BoogieTranslator took 757.22ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 30.5MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:25:33,872 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.29ms. Allocated memory is still 60.8MB. Free memory was 30.5MB in the beginning and 27.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:25:33,873 INFO L158 Benchmark]: Boogie Preprocessor took 32.13ms. Allocated memory is still 60.8MB. Free memory was 27.9MB in the beginning and 25.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:25:33,873 INFO L158 Benchmark]: RCFGBuilder took 1060.07ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 25.5MB in the beginning and 46.6MB in the end (delta: -21.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2022-11-19 07:25:33,873 INFO L158 Benchmark]: TraceAbstraction took 28537.13ms. Allocated memory was 81.8MB in the beginning and 381.7MB in the end (delta: 299.9MB). Free memory was 46.1MB in the beginning and 299.3MB in the end (delta: -253.2MB). Peak memory consumption was 270.3MB. Max. memory is 16.1GB. [2022-11-19 07:25:33,874 INFO L158 Benchmark]: Witness Printer took 4.18ms. Allocated memory is still 381.7MB. Free memory is still 299.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:25:33,875 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.59ms. Allocated memory is still 60.8MB. Free memory was 42.9MB in the beginning and 42.8MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 757.22ms. Allocated memory is still 60.8MB. Free memory was 39.5MB in the beginning and 30.5MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.29ms. Allocated memory is still 60.8MB. Free memory was 30.5MB in the beginning and 27.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.13ms. Allocated memory is still 60.8MB. Free memory was 27.9MB in the beginning and 25.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1060.07ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 25.5MB in the beginning and 46.6MB in the end (delta: -21.0MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. * TraceAbstraction took 28537.13ms. Allocated memory was 81.8MB in the beginning and 381.7MB in the end (delta: 299.9MB). Free memory was 46.1MB in the beginning and 299.3MB in the end (delta: -253.2MB). Peak memory consumption was 270.3MB. Max. memory is 16.1GB. * Witness Printer took 4.18ms. Allocated memory is still 381.7MB. Free memory is still 299.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 11.6s, 158 PlacesBefore, 55 PlacesAfterwards, 147 TransitionsBefore, 43 TransitionsAfterwards, 3434 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 144 TotalNumberOfCompositions, 9430 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4189, independent: 3981, independent conditional: 0, independent unconditional: 3981, dependent: 208, dependent conditional: 0, dependent unconditional: 208, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2487, independent: 2423, independent conditional: 0, independent unconditional: 2423, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2487, independent: 2399, independent conditional: 0, independent unconditional: 2399, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 88, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 476, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 422, dependent conditional: 0, dependent unconditional: 422, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4189, independent: 1558, independent conditional: 0, independent unconditional: 1558, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 2487, unknown conditional: 0, unknown unconditional: 2487] , Statistics on independence cache: Total cache size (in pairs): 284, Positive cache size: 253, Positive conditional cache size: 0, Positive unconditional cache size: 253, Negative cache size: 31, Negative conditional cache size: 0, Negative unconditional cache size: 31, 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L737] 0 int y$w_buff0; [L739] 0 int y$w_buff1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L724] 0 int y$mem_tmp; [L729] 0 _Bool y$r_buff0_thd4; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L735] 0 _Bool y$read_delayed; [L716] 0 int a = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L710] 0 int __unbuffered_cnt = 0; [L723] 0 _Bool y$flush_delayed; [L740] 0 _Bool y$w_buff1_used; [L718] 0 _Bool main$tmp_guard1; [L717] 0 _Bool main$tmp_guard0; [L714] 0 int __unbuffered_p3_EAX = 0; [L736] 0 int *y$read_delayed_var; [L738] 0 _Bool y$w_buff0_used; [L720] 0 int x = 0; [L730] 0 _Bool y$r_buff1_thd0; [L722] 0 int y = 0; [L732] 0 _Bool y$r_buff1_thd2; [L742] 0 int z = 0; [L731] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd4; [L733] 0 _Bool y$r_buff1_thd3; [L841] 0 pthread_t t1433; [L842] FCALL, FORK 0 pthread_create(&t1433, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1433, ((void *)0), P0, ((void *)0))=0, t1433={11: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L843] 0 pthread_t t1434; [L844] FCALL, FORK 0 pthread_create(&t1434, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1434, ((void *)0), P1, ((void *)0))=1, t1433={11:0}, t1434={15: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L845] 0 pthread_t t1435; [L846] FCALL, FORK 0 pthread_create(&t1435, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1435, ((void *)0), P2, ((void *)0))=2, t1433={11:0}, t1434={15:0}, t1435={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] 0 pthread_t t1436; [L848] FCALL, FORK 0 pthread_create(&t1436, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1436, ((void *)0), P3, ((void *)0))=3, t1433={11:0}, t1434={15:0}, t1435={7:0}, t1436={-2147483637: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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L820] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L821] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L822] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L823] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L826] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 4 return 0; [L763] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 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) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 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 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L769] 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) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 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 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 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 [L857] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1433={11:0}, t1434={15:0}, t1435={7:0}, t1436={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L861] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L862] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L863] 0 y$flush_delayed = weak$$choice2 [L864] 0 y$mem_tmp = y [L865] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L866] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L867] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L868] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L869] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L870] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L871] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L872] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L873] 0 y = y$flush_delayed ? y$mem_tmp : y [L874] 0 y$flush_delayed = (_Bool)0 [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 846]: 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: 842]: 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: 844]: 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: 848]: 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 9 procedures, 182 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 28.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 445 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 445 mSDsluCounter, 492 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 281 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1660 IncrementalHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 134 mSDtfsCounter, 1660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 228 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4380occurred in iteration=0, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1507 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 279 ConstructedInterpolants, 95 QuantifiedInterpolants, 6757 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2345 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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-19 07:25:33,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e34b69da-5864-4d2e-b093-59ac073e1d08/bin/utaipan-I9t0OCRTmS/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