./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI --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 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- 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-5e519f3 [2022-11-03 02:20:30,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:20:30,106 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:20:30,165 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:20:30,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:20:30,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:20:30,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:20:30,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:20:30,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:20:30,178 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:20:30,179 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:20:30,180 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:20:30,181 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:20:30,182 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:20:30,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:20:30,191 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:20:30,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:20:30,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:20:30,204 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:20:30,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:20:30,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:20:30,214 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:20:30,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:20:30,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:20:30,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:20:30,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:20:30,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:20:30,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:20:30,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:20:30,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:20:30,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:20:30,233 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:20:30,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:20:30,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:20:30,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:20:30,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:20:30,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:20:30,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:20:30,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:20:30,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:20:30,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:20:30,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 02:20:30,299 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:20:30,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:20:30,300 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:20:30,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:20:30,302 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:20:30,302 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:20:30,302 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:20:30,302 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:20:30,303 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:20:30,303 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:20:30,304 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:20:30,304 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:20:30,304 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:20:30,305 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:20:30,305 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:20:30,305 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:20:30,305 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:20:30,306 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:20:30,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:20:30,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:20:30,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:20:30,307 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:20:30,307 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:20:30,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:20:30,309 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:20:30,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:20:30,310 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:20:30,310 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:20:30,310 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 02:20:30,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:20:30,311 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:20:30,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:20:30,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:20:30,311 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:20:30,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:20:30,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:20:30,312 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:20:30,312 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:20:30,312 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:20:30,313 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:20:30,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:20:30,313 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:20:30,313 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_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/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_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI 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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2022-11-03 02:20:30,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:20:30,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:20:30,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:20:30,727 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:20:30,728 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:20:30,730 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2022-11-03 02:20:30,816 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data/a30f86162/31567e398a0749059176dbcb095e5fc6/FLAG9f6fe5fdc [2022-11-03 02:20:31,571 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:20:31,572 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2022-11-03 02:20:31,591 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data/a30f86162/31567e398a0749059176dbcb095e5fc6/FLAG9f6fe5fdc [2022-11-03 02:20:31,835 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data/a30f86162/31567e398a0749059176dbcb095e5fc6 [2022-11-03 02:20:31,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:20:31,840 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:20:31,849 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:20:31,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:20:31,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:20:31,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:20:31" (1/1) ... [2022-11-03 02:20:31,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c9d0016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:31, skipping insertion in model container [2022-11-03 02:20:31,858 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:20:31" (1/1) ... [2022-11-03 02:20:31,867 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:20:31,945 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:20:32,282 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-11-03 02:20:32,287 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-11-03 02:20:32,288 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-11-03 02:20:32,289 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-11-03 02:20:32,290 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-11-03 02:20:32,292 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-11-03 02:20:32,293 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-11-03 02:20:32,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:20:32,307 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:20:32,348 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-11-03 02:20:32,349 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-11-03 02:20:32,350 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-11-03 02:20:32,351 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-11-03 02:20:32,352 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-11-03 02:20:32,353 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-11-03 02:20:32,354 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-11-03 02:20:32,358 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:20:32,386 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:20:32,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32 WrapperNode [2022-11-03 02:20:32,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:20:32,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:20:32,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:20:32,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:20:32,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,484 INFO L138 Inliner]: procedures = 119, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 165 [2022-11-03 02:20:32,484 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:20:32,485 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:20:32,485 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:20:32,485 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:20:32,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,560 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:20:32,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:20:32,580 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:20:32,580 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:20:32,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (1/1) ... [2022-11-03 02:20:32,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:20:32,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:20:32,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:20:32,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:20:32,672 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:20:32,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:20:32,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:20:32,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:20:32,852 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:20:32,854 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:20:33,549 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:20:33,636 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:20:33,636 INFO L300 CfgBuilder]: Removed 17 assume(true) statements. [2022-11-03 02:20:33,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:20:33 BoogieIcfgContainer [2022-11-03 02:20:33,644 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:20:33,647 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:20:33,647 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:20:33,652 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:20:33,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:20:31" (1/3) ... [2022-11-03 02:20:33,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c85b7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:20:33, skipping insertion in model container [2022-11-03 02:20:33,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:20:32" (2/3) ... [2022-11-03 02:20:33,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c85b7d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:20:33, skipping insertion in model container [2022-11-03 02:20:33,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:20:33" (3/3) ... [2022-11-03 02:20:33,658 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2022-11-03 02:20:33,682 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:20:33,682 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-11-03 02:20:33,769 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:20:33,780 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;@6ed53425, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:20:33,780 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-11-03 02:20:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 70 states have (on average 2.5) internal successors, (175), 147 states have internal predecessors, (175), 0 states have call successors, (0), 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-03 02:20:33,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:20:33,809 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:33,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:20:33,811 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:33,820 INFO L85 PathProgramCache]: Analyzing trace with hash 10575, now seen corresponding path program 1 times [2022-11-03 02:20:33,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:33,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024946508] [2022-11-03 02:20:33,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:33,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:34,085 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-03 02:20:34,085 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:34,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024946508] [2022-11-03 02:20:34,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024946508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:34,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:34,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:20:34,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881748291] [2022-11-03 02:20:34,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:34,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:20:34,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:34,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:20:34,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:34,134 INFO L87 Difference]: Start difference. First operand has 148 states, 70 states have (on average 2.5) internal successors, (175), 147 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-03 02:20:34,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:34,446 INFO L93 Difference]: Finished difference Result 171 states and 177 transitions. [2022-11-03 02:20:34,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:20:34,449 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-03 02:20:34,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:34,463 INFO L225 Difference]: With dead ends: 171 [2022-11-03 02:20:34,464 INFO L226 Difference]: Without dead ends: 169 [2022-11-03 02:20:34,466 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-03 02:20:34,473 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 135 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:34,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 89 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:34,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-03 02:20:34,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 144. [2022-11-03 02:20:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 70 states have (on average 2.1285714285714286) internal successors, (149), 143 states have internal predecessors, (149), 0 states have call successors, (0), 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-03 02:20:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2022-11-03 02:20:34,518 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 2 [2022-11-03 02:20:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:34,518 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2022-11-03 02:20:34,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-03 02:20:34,519 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2022-11-03 02:20:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-03 02:20:34,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:34,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-03 02:20:34,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:20:34,520 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:34,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:34,521 INFO L85 PathProgramCache]: Analyzing trace with hash 10576, now seen corresponding path program 1 times [2022-11-03 02:20:34,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:34,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688922794] [2022-11-03 02:20:34,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:34,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:34,649 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-03 02:20:34,649 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:34,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688922794] [2022-11-03 02:20:34,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688922794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:34,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:34,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-03 02:20:34,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567594852] [2022-11-03 02:20:34,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:34,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:20:34,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:34,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:20:34,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:34,674 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-03 02:20:34,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:34,810 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2022-11-03 02:20:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:20:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2022-11-03 02:20:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:34,812 INFO L225 Difference]: With dead ends: 141 [2022-11-03 02:20:34,812 INFO L226 Difference]: Without dead ends: 141 [2022-11-03 02:20:34,813 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-03 02:20:34,814 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 142 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:34,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 75 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:20:34,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-03 02:20:34,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-11-03 02:20:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 70 states have (on average 2.085714285714286) internal successors, (146), 140 states have internal predecessors, (146), 0 states have call successors, (0), 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-03 02:20:34,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2022-11-03 02:20:34,827 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 2 [2022-11-03 02:20:34,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:34,827 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2022-11-03 02:20:34,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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-03 02:20:34,828 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2022-11-03 02:20:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:20:34,828 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:34,828 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:20:34,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:20:34,829 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:34,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:34,830 INFO L85 PathProgramCache]: Analyzing trace with hash 315025734, now seen corresponding path program 1 times [2022-11-03 02:20:34,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:34,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854313792] [2022-11-03 02:20:34,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:34,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:34,935 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-03 02:20:34,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:34,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854313792] [2022-11-03 02:20:34,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854313792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:34,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:34,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:20:34,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198711558] [2022-11-03 02:20:34,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:34,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:20:34,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:34,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:20:34,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:34,939 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:35,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:35,082 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2022-11-03 02:20:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:20:35,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 02:20:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:35,084 INFO L225 Difference]: With dead ends: 139 [2022-11-03 02:20:35,085 INFO L226 Difference]: Without dead ends: 139 [2022-11-03 02:20:35,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:35,086 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 121 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:35,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 77 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:20:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-03 02:20:35,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2022-11-03 02:20:35,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 72 states have (on average 1.9861111111111112) internal successors, (143), 135 states have internal predecessors, (143), 0 states have call successors, (0), 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-03 02:20:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2022-11-03 02:20:35,097 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 5 [2022-11-03 02:20:35,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:35,098 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2022-11-03 02:20:35,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:35,098 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2022-11-03 02:20:35,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:20:35,099 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:35,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:20:35,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:20:35,100 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:35,100 INFO L85 PathProgramCache]: Analyzing trace with hash 315025735, now seen corresponding path program 1 times [2022-11-03 02:20:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:35,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686506873] [2022-11-03 02:20:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:35,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:35,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:35,233 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-03 02:20:35,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:35,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686506873] [2022-11-03 02:20:35,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686506873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:35,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:35,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:20:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490068020] [2022-11-03 02:20:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:35,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:20:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:35,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:20:35,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:35,243 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:35,432 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2022-11-03 02:20:35,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:20:35,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-03 02:20:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:35,436 INFO L225 Difference]: With dead ends: 149 [2022-11-03 02:20:35,436 INFO L226 Difference]: Without dead ends: 149 [2022-11-03 02:20:35,437 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:20:35,447 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 116 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:35,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 83 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:35,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-03 02:20:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 138. [2022-11-03 02:20:35,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 77 states have (on average 1.8831168831168832) internal successors, (145), 137 states have internal predecessors, (145), 0 states have call successors, (0), 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-03 02:20:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2022-11-03 02:20:35,463 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 5 [2022-11-03 02:20:35,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:35,463 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2022-11-03 02:20:35,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2022-11-03 02:20:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:20:35,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:35,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:35,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:20:35,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:35,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:35,466 INFO L85 PathProgramCache]: Analyzing trace with hash -917302037, now seen corresponding path program 1 times [2022-11-03 02:20:35,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:35,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879390206] [2022-11-03 02:20:35,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:35,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:35,787 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-03 02:20:35,787 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:35,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879390206] [2022-11-03 02:20:35,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879390206] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:35,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:35,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:20:35,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346812937] [2022-11-03 02:20:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:35,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:20:35,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:35,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:20:35,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:20:35,790 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:36,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:36,019 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2022-11-03 02:20:36,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:36,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:20:36,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:36,030 INFO L225 Difference]: With dead ends: 135 [2022-11-03 02:20:36,030 INFO L226 Difference]: Without dead ends: 135 [2022-11-03 02:20:36,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:36,031 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 178 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:36,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 61 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:36,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-03 02:20:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2022-11-03 02:20:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 79 states have (on average 1.6962025316455696) internal successors, (134), 124 states have internal predecessors, (134), 0 states have call successors, (0), 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-03 02:20:36,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2022-11-03 02:20:36,048 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 10 [2022-11-03 02:20:36,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:36,049 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2022-11-03 02:20:36,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:36,049 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2022-11-03 02:20:36,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:20:36,051 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:36,051 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:36,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:20:36,052 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:36,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash -917302036, now seen corresponding path program 1 times [2022-11-03 02:20:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:36,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931539270] [2022-11-03 02:20:36,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:36,307 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-03 02:20:36,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:36,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931539270] [2022-11-03 02:20:36,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931539270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:36,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:36,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:20:36,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277039776] [2022-11-03 02:20:36,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:36,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:20:36,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:36,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:20:36,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:20:36,312 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:36,582 INFO L93 Difference]: Finished difference Result 154 states and 164 transitions. [2022-11-03 02:20:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:20:36,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:20:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:36,583 INFO L225 Difference]: With dead ends: 154 [2022-11-03 02:20:36,584 INFO L226 Difference]: Without dead ends: 154 [2022-11-03 02:20:36,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:36,585 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 143 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:36,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 94 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-03 02:20:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 133. [2022-11-03 02:20:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 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-03 02:20:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-11-03 02:20:36,594 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 10 [2022-11-03 02:20:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:36,594 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-11-03 02:20:36,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:36,595 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-11-03 02:20:36,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:20:36,595 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:36,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:36,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:20:36,596 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:36,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1058698336, now seen corresponding path program 1 times [2022-11-03 02:20:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:36,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494257627] [2022-11-03 02:20:36,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:36,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:36,815 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-03 02:20:36,815 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:36,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494257627] [2022-11-03 02:20:36,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494257627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:36,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:36,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:20:36,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190165318] [2022-11-03 02:20:36,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:36,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:20:36,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:36,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:20:36,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:36,818 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-03 02:20:37,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:37,005 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-11-03 02:20:37,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:37,005 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-03 02:20:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:37,006 INFO L225 Difference]: With dead ends: 132 [2022-11-03 02:20:37,006 INFO L226 Difference]: Without dead ends: 132 [2022-11-03 02:20:37,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03 02:20:37,008 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:37,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 281 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-03 02:20:37,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-03 02:20:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 88 states have (on average 1.625) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 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-03 02:20:37,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-11-03 02:20:37,018 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 12 [2022-11-03 02:20:37,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:37,018 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-11-03 02:20:37,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-03 02:20:37,019 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-11-03 02:20:37,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:20:37,019 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:37,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:37,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:20:37,020 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:37,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:37,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1058698335, now seen corresponding path program 1 times [2022-11-03 02:20:37,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:37,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350170555] [2022-11-03 02:20:37,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:37,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:37,379 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-03 02:20:37,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:37,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350170555] [2022-11-03 02:20:37,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350170555] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:37,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:37,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:20:37,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860272940] [2022-11-03 02:20:37,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:37,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:20:37,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:37,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:20:37,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:37,381 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-03 02:20:37,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:37,613 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-03 02:20:37,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:37,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-03 02:20:37,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:37,614 INFO L225 Difference]: With dead ends: 131 [2022-11-03 02:20:37,614 INFO L226 Difference]: Without dead ends: 131 [2022-11-03 02:20:37,615 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03 02:20:37,615 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 3 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:37,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 264 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:37,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-03 02:20:37,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-11-03 02:20:37,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 88 states have (on average 1.6022727272727273) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 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-03 02:20:37,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2022-11-03 02:20:37,625 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 12 [2022-11-03 02:20:37,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:37,626 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2022-11-03 02:20:37,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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-03 02:20:37,626 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-11-03 02:20:37,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:20:37,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:37,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:37,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:20:37,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:37,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1058908962, now seen corresponding path program 1 times [2022-11-03 02:20:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:37,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846774160] [2022-11-03 02:20:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:37,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:37,719 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-03 02:20:37,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:37,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846774160] [2022-11-03 02:20:37,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846774160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:37,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:37,720 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:20:37,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334958977] [2022-11-03 02:20:37,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:37,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:20:37,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:37,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:20:37,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:37,721 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-03 02:20:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:37,957 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2022-11-03 02:20:37,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:37,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-03 02:20:37,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:37,959 INFO L225 Difference]: With dead ends: 165 [2022-11-03 02:20:37,960 INFO L226 Difference]: Without dead ends: 165 [2022-11-03 02:20:37,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-03 02:20:37,963 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 239 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:37,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 119 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:37,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-03 02:20:37,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 129. [2022-11-03 02:20:37,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 87 states have (on average 1.5747126436781609) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 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-03 02:20:37,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2022-11-03 02:20:37,968 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 12 [2022-11-03 02:20:37,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:37,973 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2022-11-03 02:20:37,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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-03 02:20:37,973 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-11-03 02:20:37,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:20:37,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:37,974 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:37,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:20:37,974 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:37,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:37,980 INFO L85 PathProgramCache]: Analyzing trace with hash 498418439, now seen corresponding path program 1 times [2022-11-03 02:20:37,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:37,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288854916] [2022-11-03 02:20:37,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:37,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:38,339 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-03 02:20:38,339 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:38,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288854916] [2022-11-03 02:20:38,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288854916] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:38,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:38,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:20:38,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268178160] [2022-11-03 02:20:38,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:38,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:20:38,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:38,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:20:38,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:20:38,342 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:38,655 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2022-11-03 02:20:38,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:20:38,655 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:20:38,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:38,656 INFO L225 Difference]: With dead ends: 128 [2022-11-03 02:20:38,656 INFO L226 Difference]: Without dead ends: 128 [2022-11-03 02:20:38,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:20:38,657 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 154 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:38,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 132 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-03 02:20:38,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-11-03 02:20:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 87 states have (on average 1.5632183908045978) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 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-03 02:20:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2022-11-03 02:20:38,662 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 14 [2022-11-03 02:20:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:38,662 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2022-11-03 02:20:38,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:38,662 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-11-03 02:20:38,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:20:38,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:38,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:38,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:20:38,663 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:38,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:38,664 INFO L85 PathProgramCache]: Analyzing trace with hash 498418440, now seen corresponding path program 1 times [2022-11-03 02:20:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:38,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088780878] [2022-11-03 02:20:38,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:38,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:39,194 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-03 02:20:39,195 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:39,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088780878] [2022-11-03 02:20:39,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088780878] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:39,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:39,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:20:39,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930770047] [2022-11-03 02:20:39,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:39,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:20:39,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:39,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:20:39,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:20:39,200 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:39,715 INFO L93 Difference]: Finished difference Result 143 states and 152 transitions. [2022-11-03 02:20:39,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:20:39,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:20:39,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:39,717 INFO L225 Difference]: With dead ends: 143 [2022-11-03 02:20:39,717 INFO L226 Difference]: Without dead ends: 143 [2022-11-03 02:20:39,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:20:39,718 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 195 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:39,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 170 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:20:39,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-03 02:20:39,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 130. [2022-11-03 02:20:39,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 129 states have internal predecessors, (141), 0 states have call successors, (0), 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-03 02:20:39,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-11-03 02:20:39,722 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 14 [2022-11-03 02:20:39,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:39,722 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-11-03 02:20:39,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:39,723 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-11-03 02:20:39,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:20:39,723 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:39,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:39,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:20:39,724 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:39,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:39,724 INFO L85 PathProgramCache]: Analyzing trace with hash 581970791, now seen corresponding path program 1 times [2022-11-03 02:20:39,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:39,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229050427] [2022-11-03 02:20:39,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:39,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:39,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:40,050 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-03 02:20:40,051 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:40,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229050427] [2022-11-03 02:20:40,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229050427] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:40,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:40,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:20:40,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823830902] [2022-11-03 02:20:40,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:40,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:20:40,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:40,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:20:40,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:20:40,054 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-03 02:20:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:40,483 INFO L93 Difference]: Finished difference Result 182 states and 198 transitions. [2022-11-03 02:20:40,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:20:40,484 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-03 02:20:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:40,485 INFO L225 Difference]: With dead ends: 182 [2022-11-03 02:20:40,485 INFO L226 Difference]: Without dead ends: 182 [2022-11-03 02:20:40,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:20:40,486 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 267 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:40,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 232 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:20:40,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-11-03 02:20:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 137. [2022-11-03 02:20:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 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-03 02:20:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2022-11-03 02:20:40,491 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 15 [2022-11-03 02:20:40,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:40,491 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2022-11-03 02:20:40,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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-03 02:20:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2022-11-03 02:20:40,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:20:40,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:40,492 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-03 02:20:40,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:20:40,492 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1426778663, now seen corresponding path program 1 times [2022-11-03 02:20:40,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:40,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324845403] [2022-11-03 02:20:40,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:40,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:40,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-03 02:20:40,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:40,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324845403] [2022-11-03 02:20:40,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324845403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:40,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:40,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:20:40,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171483967] [2022-11-03 02:20:40,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:40,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:20:40,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:40,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:20:40,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:20:40,653 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:40,788 INFO L93 Difference]: Finished difference Result 135 states and 146 transitions. [2022-11-03 02:20:40,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:20:40,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 02:20:40,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:40,790 INFO L225 Difference]: With dead ends: 135 [2022-11-03 02:20:40,790 INFO L226 Difference]: Without dead ends: 135 [2022-11-03 02:20:40,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:40,792 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 19 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:40,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 192 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:20:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-03 02:20:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-11-03 02:20:40,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 101 states have (on average 1.4455445544554455) internal successors, (146), 134 states have internal predecessors, (146), 0 states have call successors, (0), 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-03 02:20:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 146 transitions. [2022-11-03 02:20:40,798 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 146 transitions. Word has length 19 [2022-11-03 02:20:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:40,800 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 146 transitions. [2022-11-03 02:20:40,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 146 transitions. [2022-11-03 02:20:40,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:20:40,803 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:40,804 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-03 02:20:40,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:20:40,804 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:40,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:40,805 INFO L85 PathProgramCache]: Analyzing trace with hash 1439231465, now seen corresponding path program 1 times [2022-11-03 02:20:40,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:40,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681649007] [2022-11-03 02:20:40,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:40,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:40,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:40,982 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-03 02:20:40,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:40,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681649007] [2022-11-03 02:20:40,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681649007] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:40,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:40,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:20:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744196890] [2022-11-03 02:20:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:40,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:20:40,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:40,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:20:40,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:40,985 INFO L87 Difference]: Start difference. First operand 135 states and 146 transitions. Second operand has 5 states, 4 states have (on average 4.75) 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-03 02:20:41,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:41,160 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-11-03 02:20:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:41,161 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) 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-03 02:20:41,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:41,162 INFO L225 Difference]: With dead ends: 134 [2022-11-03 02:20:41,162 INFO L226 Difference]: Without dead ends: 134 [2022-11-03 02:20:41,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03 02:20:41,163 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 3 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:41,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 249 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-03 02:20:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-03 02:20:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 133 states have internal predecessors, (145), 0 states have call successors, (0), 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-03 02:20:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-11-03 02:20:41,167 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 19 [2022-11-03 02:20:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:41,167 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-11-03 02:20:41,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) 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-03 02:20:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-11-03 02:20:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:20:41,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:41,168 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-03 02:20:41,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:20:41,168 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:41,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:41,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1439231466, now seen corresponding path program 1 times [2022-11-03 02:20:41,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:41,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951293752] [2022-11-03 02:20:41,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:41,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:41,476 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-03 02:20:41,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:41,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951293752] [2022-11-03 02:20:41,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951293752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:41,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:41,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:20:41,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069360990] [2022-11-03 02:20:41,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:41,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:20:41,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:20:41,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:20:41,479 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 5 states, 4 states have (on average 4.75) 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-03 02:20:41,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:41,676 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-11-03 02:20:41,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:20:41,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) 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-03 02:20:41,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:41,678 INFO L225 Difference]: With dead ends: 133 [2022-11-03 02:20:41,678 INFO L226 Difference]: Without dead ends: 133 [2022-11-03 02:20:41,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03 02:20:41,679 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:41,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 237 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:41,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-03 02:20:41,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-03 02:20:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.4257425742574257) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 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-03 02:20:41,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-11-03 02:20:41,683 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 19 [2022-11-03 02:20:41,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:41,683 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-11-03 02:20:41,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) 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-03 02:20:41,684 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-11-03 02:20:41,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:20:41,684 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:41,684 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] [2022-11-03 02:20:41,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 02:20:41,685 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:41,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 122215579, now seen corresponding path program 1 times [2022-11-03 02:20:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:41,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961379445] [2022-11-03 02:20:41,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:41,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:41,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:41,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:41,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961379445] [2022-11-03 02:20:42,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961379445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:42,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:42,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:20:42,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856971650] [2022-11-03 02:20:42,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:42,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 02:20:42,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:42,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 02:20:42,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:20:42,005 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 02:20:42,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:42,236 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-11-03 02:20:42,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:20:42,237 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-03 02:20:42,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:42,238 INFO L225 Difference]: With dead ends: 132 [2022-11-03 02:20:42,238 INFO L226 Difference]: Without dead ends: 132 [2022-11-03 02:20:42,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:20:42,239 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:42,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 159 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 02:20:42,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-03 02:20:42,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-03 02:20:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.4158415841584158) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 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-03 02:20:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-11-03 02:20:42,244 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 21 [2022-11-03 02:20:42,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:42,244 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-11-03 02:20:42,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 02:20:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-11-03 02:20:42,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:20:42,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:42,246 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] [2022-11-03 02:20:42,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 02:20:42,246 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:42,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash 122215580, now seen corresponding path program 1 times [2022-11-03 02:20:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:42,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241428711] [2022-11-03 02:20:42,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:42,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:42,732 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-03 02:20:42,732 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:42,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241428711] [2022-11-03 02:20:42,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241428711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:42,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:42,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:20:42,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405247601] [2022-11-03 02:20:42,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:42,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:20:42,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:20:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:20:42,735 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 02:20:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:43,143 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2022-11-03 02:20:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:20:43,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-03 02:20:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:43,144 INFO L225 Difference]: With dead ends: 130 [2022-11-03 02:20:43,144 INFO L226 Difference]: Without dead ends: 130 [2022-11-03 02:20:43,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:20:43,145 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 59 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:43,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 327 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:20:43,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-03 02:20:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2022-11-03 02:20:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 87 states have (on average 1.367816091954023) internal successors, (119), 110 states have internal predecessors, (119), 0 states have call successors, (0), 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-03 02:20:43,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 119 transitions. [2022-11-03 02:20:43,149 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 119 transitions. Word has length 21 [2022-11-03 02:20:43,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:43,149 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 119 transitions. [2022-11-03 02:20:43,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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-03 02:20:43,150 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 119 transitions. [2022-11-03 02:20:43,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-03 02:20:43,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:43,150 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:20:43,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 02:20:43,151 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1211440657, now seen corresponding path program 1 times [2022-11-03 02:20:43,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:43,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449391570] [2022-11-03 02:20:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:43,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:43,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:43,405 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:43,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449391570] [2022-11-03 02:20:43,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449391570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:20:43,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884874470] [2022-11-03 02:20:43,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:43,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:43,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:20:43,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:20:43,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 02:20:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:43,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-03 02:20:43,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:20:43,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:20:43,768 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-03 02:20:43,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-03 02:20:43,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:20:43,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:43,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:20:44,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-03 02:20:44,321 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 02:20:44,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-11-03 02:20:44,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:44,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:20:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:44,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884874470] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:20:44,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1259529281] [2022-11-03 02:20:44,657 INFO L159 IcfgInterpreter]: Started Sifa with 20 locations of interest [2022-11-03 02:20:44,658 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:20:44,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:20:44,670 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:20:44,670 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:20:44,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:20:44,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:20:44,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 02:20:44,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:20:44,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:20:44,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:20:44,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 02:20:44,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,878 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:20:44,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:20:44,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:20:44,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 02:20:44,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:44,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:20:44,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 02:20:45,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:20:45,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:20:45,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-03 02:20:45,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:20:45,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:20:45,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 02:20:45,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:45,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 02:20:45,541 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:20:48,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1259529281] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:48,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:20:48,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [5, 7, 6] total 27 [2022-11-03 02:20:49,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645958195] [2022-11-03 02:20:49,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:49,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-03 02:20:49,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:49,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-03 02:20:49,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-11-03 02:20:49,005 INFO L87 Difference]: Start difference. First operand 111 states and 119 transitions. Second operand has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:50,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:50,013 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2022-11-03 02:20:50,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:20:50,014 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-03 02:20:50,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:50,015 INFO L225 Difference]: With dead ends: 132 [2022-11-03 02:20:50,015 INFO L226 Difference]: Without dead ends: 132 [2022-11-03 02:20:50,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=176, Invalid=580, Unknown=0, NotChecked=0, Total=756 [2022-11-03 02:20:50,016 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 108 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:50,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 147 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-03 02:20:50,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-03 02:20:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 93. [2022-11-03 02:20:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 92 states have internal predecessors, (99), 0 states have call successors, (0), 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-03 02:20:50,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-11-03 02:20:50,023 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 21 [2022-11-03 02:20:50,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:50,024 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-11-03 02:20:50,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:20:50,024 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-11-03 02:20:50,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 02:20:50,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:50,026 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-03 02:20:50,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 02:20:50,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-03 02:20:50,253 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:50,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:50,254 INFO L85 PathProgramCache]: Analyzing trace with hash -2124169053, now seen corresponding path program 1 times [2022-11-03 02:20:50,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:50,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514523641] [2022-11-03 02:20:50,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:50,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:50,514 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-03 02:20:50,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:50,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514523641] [2022-11-03 02:20:50,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514523641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:50,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:50,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:20:50,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276033639] [2022-11-03 02:20:50,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:50,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:20:50,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:50,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:20:50,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:20:50,517 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-03 02:20:50,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:50,644 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2022-11-03 02:20:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:20:50,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-03 02:20:50,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:50,645 INFO L225 Difference]: With dead ends: 92 [2022-11-03 02:20:50,645 INFO L226 Difference]: Without dead ends: 92 [2022-11-03 02:20:50,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 02:20:50,646 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 10 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:50,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 134 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:20:50,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-03 02:20:50,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-11-03 02:20:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 90 states have internal predecessors, (97), 0 states have call successors, (0), 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-03 02:20:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-11-03 02:20:50,650 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 22 [2022-11-03 02:20:50,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:50,650 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-11-03 02:20:50,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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-03 02:20:50,651 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-11-03 02:20:50,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:20:50,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:50,651 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] [2022-11-03 02:20:50,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-03 02:20:50,652 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:50,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:50,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1216864281, now seen corresponding path program 1 times [2022-11-03 02:20:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:50,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714560661] [2022-11-03 02:20:50,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:51,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:51,063 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:51,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714560661] [2022-11-03 02:20:51,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714560661] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:51,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:20:51,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-03 02:20:51,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325274192] [2022-11-03 02:20:51,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:51,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:20:51,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:51,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:20:51,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:20:51,067 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 02:20:51,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:51,555 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2022-11-03 02:20:51,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:20:51,556 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-03 02:20:51,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:51,557 INFO L225 Difference]: With dead ends: 140 [2022-11-03 02:20:51,557 INFO L226 Difference]: Without dead ends: 140 [2022-11-03 02:20:51,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:20:51,558 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 271 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:51,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 142 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:20:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-03 02:20:51,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 98. [2022-11-03 02:20:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 83 states have (on average 1.2530120481927711) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 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-03 02:20:51,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-11-03 02:20:51,562 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 24 [2022-11-03 02:20:51,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:51,562 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-11-03 02:20:51,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 02:20:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-11-03 02:20:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 02:20:51,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:51,563 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, 1] [2022-11-03 02:20:51,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 02:20:51,564 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:51,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:51,564 INFO L85 PathProgramCache]: Analyzing trace with hash 233122547, now seen corresponding path program 1 times [2022-11-03 02:20:51,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:51,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572378329] [2022-11-03 02:20:51,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:51,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:51,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:51,751 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:51,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:51,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572378329] [2022-11-03 02:20:51,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572378329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:20:51,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95068457] [2022-11-03 02:20:51,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:51,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:51,752 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:20:51,753 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:20:51,765 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 02:20:51,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:51,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:20:51,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:20:51,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:20:52,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:20:52,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:20:52,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:20:52,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95068457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:20:52,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 02:20:52,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-03 02:20:52,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367222264] [2022-11-03 02:20:52,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:20:52,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:20:52,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:52,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:20:52,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:20:52,019 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-03 02:20:52,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:52,147 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-11-03 02:20:52,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:20:52,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-11-03 02:20:52,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:52,148 INFO L225 Difference]: With dead ends: 112 [2022-11-03 02:20:52,148 INFO L226 Difference]: Without dead ends: 112 [2022-11-03 02:20:52,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:20:52,149 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:52,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 137 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:20:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-03 02:20:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2022-11-03 02:20:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 106 states have internal predecessors, (114), 0 states have call successors, (0), 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-03 02:20:52,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2022-11-03 02:20:52,153 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 28 [2022-11-03 02:20:52,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:52,153 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2022-11-03 02:20:52,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 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-03 02:20:52,154 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2022-11-03 02:20:52,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:20:52,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:52,154 INFO L195 NwaCegarLoop]: trace histogram [2, 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-03 02:20:52,201 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:20:52,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:52,355 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:52,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:52,356 INFO L85 PathProgramCache]: Analyzing trace with hash 888553267, now seen corresponding path program 1 times [2022-11-03 02:20:52,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:52,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286423110] [2022-11-03 02:20:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:52,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:20:52,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:20:52,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286423110] [2022-11-03 02:20:52,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286423110] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 02:20:52,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690649464] [2022-11-03 02:20:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:52,620 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:20:52,621 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:20:52,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 02:20:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:20:52,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 27 conjunts are in the unsatisfiable core [2022-11-03 02:20:52,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:20:52,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:20:52,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:20:52,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:20:52,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:20:52,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:20:52,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:20:53,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:20:53,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:20:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:20:53,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:20:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:20:53,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690649464] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:20:53,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1159241257] [2022-11-03 02:20:53,251 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-03 02:20:53,251 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 02:20:53,251 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 02:20:53,252 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 02:20:53,252 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 02:20:53,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-03 02:20:53,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:20:53,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-03 02:20:53,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:20:53,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-03 02:20:53,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:20:53,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:20:53,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:20:53,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-03 02:20:53,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-11-03 02:20:53,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:20:53,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:20:53,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-03 02:20:53,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-03 02:20:53,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:20:53,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,571 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-03 02:20:53,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:20:53,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 02:20:53,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2022-11-03 02:20:53,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:20:53,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 02:20:54,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:20:54,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:20:54,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 9 [2022-11-03 02:20:54,153 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 02:20:57,869 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6312#(and (= |ULTIMATE.start_main_~null~0#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1)) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-03 02:20:57,869 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 02:20:57,869 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 02:20:57,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-11-03 02:20:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034374113] [2022-11-03 02:20:57,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 02:20:57,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:20:57,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:20:57,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:20:57,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=711, Unknown=0, NotChecked=0, Total=870 [2022-11-03 02:20:57,872 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 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-03 02:20:58,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:20:58,473 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-11-03 02:20:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:20:58,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 02:20:58,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:20:58,478 INFO L225 Difference]: With dead ends: 156 [2022-11-03 02:20:58,478 INFO L226 Difference]: Without dead ends: 156 [2022-11-03 02:20:58,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=211, Invalid=1049, Unknown=0, NotChecked=0, Total=1260 [2022-11-03 02:20:58,479 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 217 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:20:58,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 139 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:20:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-03 02:20:58,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 125. [2022-11-03 02:20:58,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 124 states have internal predecessors, (135), 0 states have call successors, (0), 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-03 02:20:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-11-03 02:20:58,483 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 29 [2022-11-03 02:20:58,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:20:58,483 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-11-03 02:20:58,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.636363636363637) internal successors, (73), 11 states have internal predecessors, (73), 0 states have call successors, (0), 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-03 02:20:58,484 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-11-03 02:20:58,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:20:58,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:20:58,487 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, 1, 1] [2022-11-03 02:20:58,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:20:58,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:20:58,697 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:20:58,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:20:58,698 INFO L85 PathProgramCache]: Analyzing trace with hash 888555356, now seen corresponding path program 1 times [2022-11-03 02:20:58,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:20:58,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210706503] [2022-11-03 02:20:58,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:20:58,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:20:58,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:20:58,723 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:20:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:20:58,787 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:20:58,787 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:20:58,788 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2022-11-03 02:20:58,789 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2022-11-03 02:20:58,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2022-11-03 02:20:58,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2022-11-03 02:20:58,790 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2022-11-03 02:20:58,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2022-11-03 02:20:58,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2022-11-03 02:20:58,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2022-11-03 02:20:58,791 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2022-11-03 02:20:58,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2022-11-03 02:20:58,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2022-11-03 02:20:58,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2022-11-03 02:20:58,792 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2022-11-03 02:20:58,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2022-11-03 02:20:58,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2022-11-03 02:20:58,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2022-11-03 02:20:58,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2022-11-03 02:20:58,793 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2022-11-03 02:20:58,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2022-11-03 02:20:58,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2022-11-03 02:20:58,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2022-11-03 02:20:58,794 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2022-11-03 02:20:58,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2022-11-03 02:20:58,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2022-11-03 02:20:58,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2022-11-03 02:20:58,795 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2022-11-03 02:20:58,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2022-11-03 02:20:58,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2022-11-03 02:20:58,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2022-11-03 02:20:58,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2022-11-03 02:20:58,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2022-11-03 02:20:58,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2022-11-03 02:20:58,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2022-11-03 02:20:58,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2022-11-03 02:20:58,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2022-11-03 02:20:58,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2022-11-03 02:20:58,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2022-11-03 02:20:58,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2022-11-03 02:20:58,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2022-11-03 02:20:58,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2022-11-03 02:20:58,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2022-11-03 02:20:58,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (35 of 77 remaining) [2022-11-03 02:20:58,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2022-11-03 02:20:58,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 77 remaining) [2022-11-03 02:20:58,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (32 of 77 remaining) [2022-11-03 02:20:58,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (31 of 77 remaining) [2022-11-03 02:20:58,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (30 of 77 remaining) [2022-11-03 02:20:58,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2022-11-03 02:20:58,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2022-11-03 02:20:58,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (27 of 77 remaining) [2022-11-03 02:20:58,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2022-11-03 02:20:58,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2022-11-03 02:20:58,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2022-11-03 02:20:58,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2022-11-03 02:20:58,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (22 of 77 remaining) [2022-11-03 02:20:58,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2022-11-03 02:20:58,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2022-11-03 02:20:58,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (19 of 77 remaining) [2022-11-03 02:20:58,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2022-11-03 02:20:58,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2022-11-03 02:20:58,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2022-11-03 02:20:58,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2022-11-03 02:20:58,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2022-11-03 02:20:58,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2022-11-03 02:20:58,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (12 of 77 remaining) [2022-11-03 02:20:58,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (11 of 77 remaining) [2022-11-03 02:20:58,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (10 of 77 remaining) [2022-11-03 02:20:58,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2022-11-03 02:20:58,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2022-11-03 02:20:58,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (7 of 77 remaining) [2022-11-03 02:20:58,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (6 of 77 remaining) [2022-11-03 02:20:58,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (5 of 77 remaining) [2022-11-03 02:20:58,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2022-11-03 02:20:58,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2022-11-03 02:20:58,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (2 of 77 remaining) [2022-11-03 02:20:58,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE (1 of 77 remaining) [2022-11-03 02:20:58,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (0 of 77 remaining) [2022-11-03 02:20:58,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-03 02:20:58,812 INFO L444 BasicCegarLoop]: Path program 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-03 02:20:58,816 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:20:58,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:20:58 BoogieIcfgContainer [2022-11-03 02:20:58,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:20:58,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:20:58,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:20:58,849 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:20:58,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:20:33" (3/4) ... [2022-11-03 02:20:58,852 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 02:20:58,853 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:20:58,853 INFO L158 Benchmark]: Toolchain (without parser) took 27012.94ms. Allocated memory was 102.8MB in the beginning and 272.6MB in the end (delta: 169.9MB). Free memory was 62.8MB in the beginning and 210.9MB in the end (delta: -148.1MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-11-03 02:20:58,853 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 102.8MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:20:58,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.75ms. Allocated memory is still 102.8MB. Free memory was 62.6MB in the beginning and 70.2MB in the end (delta: -7.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:20:58,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.38ms. Allocated memory is still 102.8MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:20:58,854 INFO L158 Benchmark]: Boogie Preprocessor took 93.70ms. Allocated memory is still 102.8MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:20:58,855 INFO L158 Benchmark]: RCFGBuilder took 1064.82ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 73.4MB in the end (delta: -7.7MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2022-11-03 02:20:58,855 INFO L158 Benchmark]: TraceAbstraction took 25200.61ms. Allocated memory was 102.8MB in the beginning and 272.6MB in the end (delta: 169.9MB). Free memory was 72.3MB in the beginning and 210.9MB in the end (delta: -138.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. [2022-11-03 02:20:58,855 INFO L158 Benchmark]: Witness Printer took 4.43ms. Allocated memory is still 272.6MB. Free memory is still 210.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:20:58,857 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.34ms. Allocated memory is still 102.8MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.75ms. Allocated memory is still 102.8MB. Free memory was 62.6MB in the beginning and 70.2MB in the end (delta: -7.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.38ms. Allocated memory is still 102.8MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.70ms. Allocated memory is still 102.8MB. Free memory was 67.7MB in the beginning and 66.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1064.82ms. Allocated memory is still 102.8MB. Free memory was 65.7MB in the beginning and 73.4MB in the end (delta: -7.7MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * TraceAbstraction took 25200.61ms. Allocated memory was 102.8MB in the beginning and 272.6MB in the end (delta: 169.9MB). Free memory was 72.3MB in the beginning and 210.9MB in the end (delta: -138.6MB). Peak memory consumption was 30.7MB. Max. memory is 16.1GB. * Witness Printer took 4.43ms. Allocated memory is still 272.6MB. Free memory is still 210.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={-1:0}] [L1000] null->prev = ((void*)0) VAL [null={-1:0}] [L1001] null->colour = BLACK [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={-2:0}, null={-1:0}] [L1005] list->prev = null VAL [list={-2:0}, null={-1:0}] [L1006] list->colour = BLACK [L1008] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1042] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1045] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1056] COND TRUE null != list VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1058] EXPR list->colour VAL [end={-1:0}, list={-2:0}, list->colour=1, null={-1:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next [L1067] end = list->next [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) [L1069] list = end VAL [end={-1:0}, list={-1:0}, null={-1:0}] [L1056] COND FALSE !(null != list) [L1073] return 0; VAL [\result=0, end={-1:0}, list={-1:0}, null={-1:0}] - 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: -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: -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: -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: -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: 1032]: 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: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: 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: 1042]: 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: 1048]: 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: 1049]: 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: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free 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: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free 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: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 25.1s, OverallIterations: 23, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2441 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2441 mSDsluCounter, 3540 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2250 mSDsCounter, 398 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4360 IncrementalHoareTripleChecker+Invalid, 4758 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 398 mSolverCounterUnsat, 1386 mSDtfsCounter, 4360 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 151 SyntacticMatches, 12 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 9.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=0, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 22 MinimizatonAttempts, 301 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 443 NumberOfCodeBlocks, 443 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 437 ConstructedInterpolants, 0 QuantifiedInterpolants, 3582 SizeOfPredicates, 14 NumberOfNonLiveVariables, 607 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 27 InterpolantComputations, 20 PerfectInterpolantSequences, 7/17 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: OVERALL_TIME: 0.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 1, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 21, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 25, TOOLS_POST_TIME: 0.7s, TOOLS_POST_CALL_APPLICATIONS: 0, TOOLS_POST_CALL_TIME: 0.0s, TOOLS_POST_RETURN_APPLICATIONS: 0, TOOLS_POST_RETURN_TIME: 0.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 25, TOOLS_QUANTIFIERELIM_TIME: 0.7s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 49, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 1, DOMAIN_JOIN_TIME: 0.0s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 1, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 21, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME: 0.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 1, CALL_SUMMARIZER_APPLICATIONS: 0, CALL_SUMMARIZER_CACHE_MISSES: 0, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 286, DAG_COMPRESSION_RETAINED_NODES: 51, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-03 02:20:58,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI --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 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- 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-5e519f3 [2022-11-03 02:21:01,575 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:21:01,578 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:21:01,630 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:21:01,631 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:21:01,636 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:21:01,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:21:01,646 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:21:01,651 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:21:01,653 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:21:01,654 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:21:01,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:21:01,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:21:01,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:21:01,666 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:21:01,668 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:21:01,670 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:21:01,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:21:01,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:21:01,680 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:21:01,687 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:21:01,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:21:01,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:21:01,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:21:01,701 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:21:01,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:21:01,705 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:21:01,706 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:21:01,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:21:01,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:21:01,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:21:01,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:21:01,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:21:01,715 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:21:01,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:21:01,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:21:01,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:21:01,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:21:01,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:21:01,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:21:01,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:21:01,728 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-11-03 02:21:01,786 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:21:01,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:21:01,787 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:21:01,787 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:21:01,788 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:21:01,789 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:21:01,789 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:21:01,789 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:21:01,790 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:21:01,790 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:21:01,791 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:21:01,791 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:21:01,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 02:21:01,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 02:21:01,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:21:01,794 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:21:01,794 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 02:21:01,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:21:01,795 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:21:01,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:21:01,795 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 02:21:01,795 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 02:21:01,796 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 02:21:01,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:21:01,796 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 02:21:01,797 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-03 02:21:01,797 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-03 02:21:01,797 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:21:01,797 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:21:01,798 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:21:01,798 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-03 02:21:01,798 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:21:01,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:21:01,799 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:21:01,799 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:21:01,800 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-03 02:21:01,800 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-03 02:21:01,800 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:21:01,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-03 02:21:01,801 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_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/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_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI 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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2022-11-03 02:21:02,228 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:21:02,255 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:21:02,258 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:21:02,260 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:21:02,261 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:21:02,262 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2022-11-03 02:21:02,341 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data/7dba8ceba/818afa908a074ca7861b6749f805df92/FLAG31929521a [2022-11-03 02:21:03,104 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:21:03,109 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2022-11-03 02:21:03,123 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data/7dba8ceba/818afa908a074ca7861b6749f805df92/FLAG31929521a [2022-11-03 02:21:03,311 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/data/7dba8ceba/818afa908a074ca7861b6749f805df92 [2022-11-03 02:21:03,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:21:03,319 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:21:03,321 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:21:03,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:21:03,327 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:21:03,328 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:21:03" (1/1) ... [2022-11-03 02:21:03,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a97cba3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:03, skipping insertion in model container [2022-11-03 02:21:03,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:21:03" (1/1) ... [2022-11-03 02:21:03,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:21:03,412 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:21:03,891 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-11-03 02:21:03,895 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-11-03 02:21:03,896 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-11-03 02:21:03,898 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-11-03 02:21:03,899 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-11-03 02:21:03,901 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-11-03 02:21:03,902 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-11-03 02:21:03,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:21:03,922 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:21:03,960 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-11-03 02:21:03,966 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-11-03 02:21:03,967 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-11-03 02:21:03,969 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-11-03 02:21:03,970 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-11-03 02:21:03,972 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-11-03 02:21:03,973 WARN L230 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_1ecf4049-15aa-4155-853b-55669f416b03/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-11-03 02:21:03,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:21:04,016 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:21:04,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04 WrapperNode [2022-11-03 02:21:04,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:21:04,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:21:04,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:21:04,018 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:21:04,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,075 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 164 [2022-11-03 02:21:04,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:21:04,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:21:04,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:21:04,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:21:04,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,093 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,093 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,106 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,135 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,145 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:21:04,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:21:04,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:21:04,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:21:04,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (1/1) ... [2022-11-03 02:21:04,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:21:04,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:21:04,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:21:04,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:21:04,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-03 02:21:04,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 02:21:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:21:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:21:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 02:21:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:21:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-03 02:21:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-03 02:21:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:21:04,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:21:04,403 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:21:04,406 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:21:05,320 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:21:05,329 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:21:05,330 INFO L300 CfgBuilder]: Removed 17 assume(true) statements. [2022-11-03 02:21:05,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:21:05 BoogieIcfgContainer [2022-11-03 02:21:05,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:21:05,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:21:05,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:21:05,354 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:21:05,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:21:03" (1/3) ... [2022-11-03 02:21:05,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7911df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:21:05, skipping insertion in model container [2022-11-03 02:21:05,356 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:21:04" (2/3) ... [2022-11-03 02:21:05,357 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b7911df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:21:05, skipping insertion in model container [2022-11-03 02:21:05,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:21:05" (3/3) ... [2022-11-03 02:21:05,359 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2022-11-03 02:21:05,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:21:05,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-11-03 02:21:05,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:21:05,447 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;@4e3bd0cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:21:05,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-11-03 02:21:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 86 states have (on average 2.244186046511628) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 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-03 02:21:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 02:21:05,461 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:05,462 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 02:21:05,462 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:05,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:05,469 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-03 02:21:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:05,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061738935] [2022-11-03 02:21:05,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:05,484 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:05,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:05,489 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:05,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-03 02:21:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:05,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:21:05,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:05,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:21:05,742 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-03 02:21:05,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:05,744 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:05,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061738935] [2022-11-03 02:21:05,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2061738935] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:05,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:05,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:21:05,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240084860] [2022-11-03 02:21:05,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:05,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:21:05,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:05,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:21:05,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:05,789 INFO L87 Difference]: Start difference. First operand has 164 states, 86 states have (on average 2.244186046511628) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03 02:21:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:06,229 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2022-11-03 02:21:06,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:21:06,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-03 02:21:06,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:06,246 INFO L225 Difference]: With dead ends: 191 [2022-11-03 02:21:06,246 INFO L226 Difference]: Without dead ends: 187 [2022-11-03 02:21:06,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:06,254 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 149 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:06,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 110 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:21:06,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-03 02:21:06,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 159. [2022-11-03 02:21:06,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 85 states have (on average 1.9294117647058824) internal successors, (164), 158 states have internal predecessors, (164), 0 states have call successors, (0), 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-03 02:21:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 164 transitions. [2022-11-03 02:21:06,301 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 164 transitions. Word has length 3 [2022-11-03 02:21:06,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:06,302 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 164 transitions. [2022-11-03 02:21:06,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03 02:21:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 164 transitions. [2022-11-03 02:21:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-03 02:21:06,304 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:06,304 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-03 02:21:06,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-03 02:21:06,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:06,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:06,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:06,511 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-03 02:21:06,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:06,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1792259067] [2022-11-03 02:21:06,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:06,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:06,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:06,516 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:06,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-03 02:21:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:06,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:21:06,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:06,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:21:06,631 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-03 02:21:06,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:06,632 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:06,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1792259067] [2022-11-03 02:21:06,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1792259067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:06,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:06,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:21:06,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335808738] [2022-11-03 02:21:06,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:06,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:21:06,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:06,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:21:06,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:06,642 INFO L87 Difference]: Start difference. First operand 159 states and 164 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03 02:21:07,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:07,189 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2022-11-03 02:21:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:21:07,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-11-03 02:21:07,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:07,191 INFO L225 Difference]: With dead ends: 156 [2022-11-03 02:21:07,191 INFO L226 Difference]: Without dead ends: 156 [2022-11-03 02:21:07,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:07,193 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:07,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 89 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:21:07,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-03 02:21:07,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-11-03 02:21:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 85 states have (on average 1.8941176470588235) internal successors, (161), 155 states have internal predecessors, (161), 0 states have call successors, (0), 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-03 02:21:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 161 transitions. [2022-11-03 02:21:07,204 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 161 transitions. Word has length 3 [2022-11-03 02:21:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:07,205 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 161 transitions. [2022-11-03 02:21:07,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-03 02:21:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 161 transitions. [2022-11-03 02:21:07,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:21:07,206 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:07,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:07,245 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:07,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:07,420 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:07,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2022-11-03 02:21:07,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:07,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760261166] [2022-11-03 02:21:07,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:07,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:07,422 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:07,429 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:07,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-03 02:21:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:07,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-03 02:21:07,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:07,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:21:07,534 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-03 02:21:07,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:07,535 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:07,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760261166] [2022-11-03 02:21:07,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760261166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:07,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:07,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:21:07,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121277079] [2022-11-03 02:21:07,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:07,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:21:07,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:07,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:21:07,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:07,538 INFO L87 Difference]: Start difference. First operand 156 states and 161 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-03 02:21:07,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:07,906 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2022-11-03 02:21:07,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:21:07,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-03 02:21:07,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:07,908 INFO L225 Difference]: With dead ends: 155 [2022-11-03 02:21:07,908 INFO L226 Difference]: Without dead ends: 155 [2022-11-03 02:21:07,908 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-03 02:21:07,910 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 133 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:07,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 95 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:21:07,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-03 02:21:07,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-11-03 02:21:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 87 states have (on average 1.8160919540229885) internal successors, (158), 150 states have internal predecessors, (158), 0 states have call successors, (0), 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-03 02:21:07,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2022-11-03 02:21:07,934 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 7 [2022-11-03 02:21:07,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:07,935 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2022-11-03 02:21:07,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-03 02:21:07,935 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2022-11-03 02:21:07,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-03 02:21:07,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:07,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:07,964 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:08,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:08,153 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:08,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:08,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2022-11-03 02:21:08,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:08,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434904153] [2022-11-03 02:21:08,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:08,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:08,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:08,158 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:08,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-03 02:21:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:08,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-03 02:21:08,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:08,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:21:08,274 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-03 02:21:08,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:08,275 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:08,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434904153] [2022-11-03 02:21:08,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1434904153] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:08,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:08,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:21:08,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139020433] [2022-11-03 02:21:08,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:08,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:21:08,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:08,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:21:08,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:08,277 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-03 02:21:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:08,694 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2022-11-03 02:21:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:21:08,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-03 02:21:08,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:08,696 INFO L225 Difference]: With dead ends: 168 [2022-11-03 02:21:08,696 INFO L226 Difference]: Without dead ends: 168 [2022-11-03 02:21:08,697 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-03 02:21:08,698 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 129 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:08,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 102 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-03 02:21:08,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-03 02:21:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2022-11-03 02:21:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.7234042553191489) internal successors, (162), 154 states have internal predecessors, (162), 0 states have call successors, (0), 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-03 02:21:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2022-11-03 02:21:08,708 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 7 [2022-11-03 02:21:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:08,709 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2022-11-03 02:21:08,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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-03 02:21:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2022-11-03 02:21:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:21:08,710 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:08,710 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:08,726 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:08,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:08,925 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:08,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594255, now seen corresponding path program 1 times [2022-11-03 02:21:08,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:08,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346736020] [2022-11-03 02:21:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:08,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:08,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:08,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:08,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-03 02:21:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:09,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 02:21:09,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:09,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:21:09,175 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:21:09,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 02:21:09,193 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-03 02:21:09,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:09,193 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:09,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346736020] [2022-11-03 02:21:09,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346736020] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:09,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:09,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:21:09,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245131388] [2022-11-03 02:21:09,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:09,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:21:09,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:09,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:21:09,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:21:09,196 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:09,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:09,769 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2022-11-03 02:21:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:21:09,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:21:09,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:09,772 INFO L225 Difference]: With dead ends: 156 [2022-11-03 02:21:09,772 INFO L226 Difference]: Without dead ends: 156 [2022-11-03 02:21:09,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:09,773 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 211 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:09,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 79 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:21:09,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-03 02:21:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 142. [2022-11-03 02:21:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 96 states have (on average 1.5729166666666667) internal successors, (151), 141 states have internal predecessors, (151), 0 states have call successors, (0), 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-03 02:21:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2022-11-03 02:21:09,782 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 12 [2022-11-03 02:21:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:09,783 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2022-11-03 02:21:09,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2022-11-03 02:21:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-03 02:21:09,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:09,784 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:09,805 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:10,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:10,006 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:10,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:10,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594254, now seen corresponding path program 1 times [2022-11-03 02:21:10,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:10,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944070031] [2022-11-03 02:21:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:10,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:10,008 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:10,010 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:10,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-03 02:21:10,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:10,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 02:21:10,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:10,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:21:10,281 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:21:10,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 02:21:10,298 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-03 02:21:10,298 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:10,298 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:10,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944070031] [2022-11-03 02:21:10,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944070031] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:10,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:10,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:21:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545246720] [2022-11-03 02:21:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:10,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:21:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:21:10,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:21:10,301 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:10,975 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2022-11-03 02:21:10,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:21:10,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-03 02:21:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:10,977 INFO L225 Difference]: With dead ends: 180 [2022-11-03 02:21:10,977 INFO L226 Difference]: Without dead ends: 180 [2022-11-03 02:21:10,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:10,978 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 175 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:10,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 117 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:21:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-03 02:21:10,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2022-11-03 02:21:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 106 states have (on average 1.5377358490566038) internal successors, (163), 150 states have internal predecessors, (163), 0 states have call successors, (0), 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-03 02:21:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2022-11-03 02:21:10,999 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 12 [2022-11-03 02:21:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:11,002 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-11-03 02:21:11,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2022-11-03 02:21:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-03 02:21:11,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:11,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:11,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:11,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:11,218 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash 195115107, now seen corresponding path program 1 times [2022-11-03 02:21:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:11,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997721119] [2022-11-03 02:21:11,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:11,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:11,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:11,221 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:11,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-03 02:21:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:11,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:21:11,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:11,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:21:11,401 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:21:11,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 02:21:11,450 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-03 02:21:11,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:11,451 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:11,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997721119] [2022-11-03 02:21:11,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997721119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:11,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:11,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:21:11,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407123308] [2022-11-03 02:21:11,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:11,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:21:11,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:11,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:21:11,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:11,455 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:12,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:12,122 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2022-11-03 02:21:12,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:21:12,123 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-03 02:21:12,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:12,125 INFO L225 Difference]: With dead ends: 194 [2022-11-03 02:21:12,125 INFO L226 Difference]: Without dead ends: 194 [2022-11-03 02:21:12,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:12,126 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 296 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:12,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 149 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:21:12,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-03 02:21:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 149. [2022-11-03 02:21:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 105 states have (on average 1.5142857142857142) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 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-03 02:21:12,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2022-11-03 02:21:12,135 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 14 [2022-11-03 02:21:12,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:12,135 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2022-11-03 02:21:12,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:12,136 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2022-11-03 02:21:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:21:12,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:12,136 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:12,156 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:12,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:12,351 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:12,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:12,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997431, now seen corresponding path program 1 times [2022-11-03 02:21:12,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:12,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [65862205] [2022-11-03 02:21:12,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:12,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:12,352 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:12,353 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:12,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-03 02:21:12,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:12,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:21:12,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:12,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:21:12,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:12,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 02:21:12,557 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-03 02:21:12,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:12,557 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:12,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [65862205] [2022-11-03 02:21:12,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [65862205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:12,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:12,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:21:12,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116606051] [2022-11-03 02:21:12,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:12,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:21:12,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:12,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:21:12,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:12,560 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:13,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:13,190 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-11-03 02:21:13,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:21:13,191 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:21:13,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:13,192 INFO L225 Difference]: With dead ends: 148 [2022-11-03 02:21:13,192 INFO L226 Difference]: Without dead ends: 148 [2022-11-03 02:21:13,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:13,193 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 9 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:13,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 334 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:21:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-03 02:21:13,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-03 02:21:13,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.4952380952380953) internal successors, (157), 147 states have internal predecessors, (157), 0 states have call successors, (0), 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-03 02:21:13,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2022-11-03 02:21:13,199 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 15 [2022-11-03 02:21:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:13,199 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2022-11-03 02:21:13,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:13,200 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2022-11-03 02:21:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 02:21:13,200 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:13,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:13,229 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:13,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:13,410 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:13,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:13,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997432, now seen corresponding path program 1 times [2022-11-03 02:21:13,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:13,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450886319] [2022-11-03 02:21:13,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:13,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:13,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:13,412 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:13,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-03 02:21:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:13,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:21:13,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:13,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:21:13,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:13,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:13,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 02:21:13,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:13,699 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-03 02:21:13,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:13,700 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:13,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450886319] [2022-11-03 02:21:13,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450886319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:13,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:13,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:21:13,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936719495] [2022-11-03 02:21:13,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:13,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:21:13,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:13,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:21:13,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:13,702 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:14,446 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2022-11-03 02:21:14,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:21:14,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-03 02:21:14,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:14,450 INFO L225 Difference]: With dead ends: 147 [2022-11-03 02:21:14,450 INFO L226 Difference]: Without dead ends: 147 [2022-11-03 02:21:14,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:14,451 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:14,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 319 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-03 02:21:14,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-03 02:21:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-11-03 02:21:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 146 states have internal predecessors, (155), 0 states have call successors, (0), 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-03 02:21:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2022-11-03 02:21:14,457 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 15 [2022-11-03 02:21:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:14,458 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2022-11-03 02:21:14,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2022-11-03 02:21:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:21:14,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:14,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:14,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:14,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:14,673 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:14,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:14,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1587467776, now seen corresponding path program 1 times [2022-11-03 02:21:14,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:14,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2072061035] [2022-11-03 02:21:14,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:14,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:14,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:14,675 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:14,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-03 02:21:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:14,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:21:14,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:14,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:21:14,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:14,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-03 02:21:14,925 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:14,925 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:14,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2072061035] [2022-11-03 02:21:14,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2072061035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:14,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:14,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:21:14,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612459214] [2022-11-03 02:21:14,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:14,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:21:14,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:14,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:21:14,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:21:14,927 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-03 02:21:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:15,625 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2022-11-03 02:21:15,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:21:15,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2022-11-03 02:21:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:15,627 INFO L225 Difference]: With dead ends: 201 [2022-11-03 02:21:15,627 INFO L226 Difference]: Without dead ends: 201 [2022-11-03 02:21:15,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:21:15,628 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 232 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:15,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 347 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:21:15,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-03 02:21:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2022-11-03 02:21:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 151 states have internal predecessors, (160), 0 states have call successors, (0), 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-03 02:21:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2022-11-03 02:21:15,633 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 17 [2022-11-03 02:21:15,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:15,634 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2022-11-03 02:21:15,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 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-03 02:21:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2022-11-03 02:21:15,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:21:15,634 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:15,634 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-03 02:21:15,659 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:15,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:15,847 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:15,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:15,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128633, now seen corresponding path program 1 times [2022-11-03 02:21:15,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:15,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [475083832] [2022-11-03 02:21:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:15,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:15,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:15,849 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:15,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-03 02:21:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:16,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-03 02:21:16,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:16,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:21:16,114 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:21:16,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 02:21:16,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:16,269 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:21:16,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 02:21:16,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:21:16,399 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-03 02:21:16,399 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:16,400 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:16,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [475083832] [2022-11-03 02:21:16,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [475083832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:16,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:16,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:21:16,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666440431] [2022-11-03 02:21:16,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:16,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:21:16,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:16,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:21:16,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:21:16,403 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-03 02:21:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:17,621 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-11-03 02:21:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:21:17,622 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-03 02:21:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:17,623 INFO L225 Difference]: With dead ends: 183 [2022-11-03 02:21:17,624 INFO L226 Difference]: Without dead ends: 183 [2022-11-03 02:21:17,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:21:17,625 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 151 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:17,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 312 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 327 Invalid, 0 Unknown, 109 Unchecked, 0.9s Time] [2022-11-03 02:21:17,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-03 02:21:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 151. [2022-11-03 02:21:17,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 110 states have (on average 1.4454545454545455) internal successors, (159), 150 states have internal predecessors, (159), 0 states have call successors, (0), 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-03 02:21:17,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2022-11-03 02:21:17,631 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 19 [2022-11-03 02:21:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:17,631 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2022-11-03 02:21:17,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-03 02:21:17,631 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2022-11-03 02:21:17,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 02:21:17,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:17,632 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-03 02:21:17,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:17,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:17,845 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:17,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:17,845 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128634, now seen corresponding path program 1 times [2022-11-03 02:21:17,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:17,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284463302] [2022-11-03 02:21:17,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:17,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:17,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:17,847 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:17,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-03 02:21:18,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:18,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:21:18,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:18,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:21:18,140 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:21:18,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 02:21:18,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:21:18,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:18,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:18,308 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:21:18,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-03 02:21:18,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:21:18,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-03 02:21:18,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:18,419 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-03 02:21:18,419 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:18,419 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:18,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284463302] [2022-11-03 02:21:18,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284463302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:18,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:18,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 02:21:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372002118] [2022-11-03 02:21:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:18,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 02:21:18,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:18,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 02:21:18,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-03 02:21:18,421 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-03 02:21:20,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:20,265 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2022-11-03 02:21:20,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:21:20,266 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-03 02:21:20,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:20,267 INFO L225 Difference]: With dead ends: 168 [2022-11-03 02:21:20,267 INFO L226 Difference]: Without dead ends: 168 [2022-11-03 02:21:20,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-11-03 02:21:20,268 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 226 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:20,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 300 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-03 02:21:20,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-03 02:21:20,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2022-11-03 02:21:20,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 153 states have internal predecessors, (166), 0 states have call successors, (0), 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-03 02:21:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2022-11-03 02:21:20,273 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 19 [2022-11-03 02:21:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:20,273 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2022-11-03 02:21:20,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 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-03 02:21:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2022-11-03 02:21:20,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:21:20,274 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:20,274 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:20,295 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:20,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:20,490 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:20,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1915505871, now seen corresponding path program 1 times [2022-11-03 02:21:20,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:20,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060732293] [2022-11-03 02:21:20,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:20,491 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:20,491 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:20,492 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:20,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-03 02:21:20,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:20,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-03 02:21:20,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:20,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:20,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:20,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:20,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:20,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:20,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:20,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:20,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:21,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:21,042 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:21:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:21,275 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:21,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060732293] [2022-11-03 02:21:21,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060732293] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:21:21,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2042761610] [2022-11-03 02:21:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:21,275 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:21:21,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:21:21,281 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:21:21,301 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2022-11-03 02:21:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:21,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:21:21,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:21,574 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:21:21,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 02:21:21,675 INFO L356 Elim1Store]: treesize reduction 42, result has 26.3 percent of original size [2022-11-03 02:21:21,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 32 [2022-11-03 02:21:21,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:21,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:21,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:21:21,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:21,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-11-03 02:21:22,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 02:21:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:22,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:21:22,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:22,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2042761610] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:21:22,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958157652] [2022-11-03 02:21:22,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:22,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:21:22,400 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:21:22,406 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:21:22,408 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-03 02:21:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:22,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-03 02:21:22,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:22,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:22,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:22,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:22,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:22,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:22,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:22,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:22,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:22,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 02:21:22,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:23,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:23,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:23,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:21:23,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:23,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958157652] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:21:23,170 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:21:23,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7, 6, 8, 6] total 26 [2022-11-03 02:21:23,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880278913] [2022-11-03 02:21:23,171 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:21:23,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-03 02:21:23,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:23,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-03 02:21:23,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2022-11-03 02:21:23,172 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 26 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 0 states have call successors, (0), 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-03 02:21:26,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:26,803 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2022-11-03 02:21:26,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-03 02:21:26,804 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 0 states have call successors, (0), 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 24 [2022-11-03 02:21:26,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:26,805 INFO L225 Difference]: With dead ends: 211 [2022-11-03 02:21:26,805 INFO L226 Difference]: Without dead ends: 211 [2022-11-03 02:21:26,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=314, Invalid=1246, Unknown=0, NotChecked=0, Total=1560 [2022-11-03 02:21:26,807 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 976 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:26,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 692 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-03 02:21:26,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-03 02:21:26,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 161. [2022-11-03 02:21:26,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.380952380952381) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 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-03 02:21:26,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2022-11-03 02:21:26,812 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 24 [2022-11-03 02:21:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:26,813 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2022-11-03 02:21:26,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 0 states have call successors, (0), 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-03 02:21:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2022-11-03 02:21:26,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:21:26,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:26,814 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] [2022-11-03 02:21:26,836 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:27,054 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:27,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:27,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt [2022-11-03 02:21:27,430 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:27,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:27,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1957524124, now seen corresponding path program 1 times [2022-11-03 02:21:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:27,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831057638] [2022-11-03 02:21:27,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:27,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:27,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:27,432 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:27,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-03 02:21:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:27,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 02:21:27,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:27,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:21:27,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:27,707 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-03 02:21:27,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:27,707 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:27,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831057638] [2022-11-03 02:21:27,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831057638] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:27,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:27,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:21:27,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186724214] [2022-11-03 02:21:27,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:27,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-03 02:21:27,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:27,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-03 02:21:27,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:21:27,709 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 02:21:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:28,379 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2022-11-03 02:21:28,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:21:28,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-03 02:21:28,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:28,381 INFO L225 Difference]: With dead ends: 184 [2022-11-03 02:21:28,381 INFO L226 Difference]: Without dead ends: 184 [2022-11-03 02:21:28,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:21:28,382 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 136 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:28,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 341 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:21:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-03 02:21:28,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2022-11-03 02:21:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.373015873015873) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 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-03 02:21:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-11-03 02:21:28,388 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 24 [2022-11-03 02:21:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:28,388 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-11-03 02:21:28,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 02:21:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-11-03 02:21:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 02:21:28,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:28,390 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] [2022-11-03 02:21:28,403 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:28,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:28,603 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:28,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:28,604 INFO L85 PathProgramCache]: Analyzing trace with hash 915476318, now seen corresponding path program 1 times [2022-11-03 02:21:28,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:28,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36053959] [2022-11-03 02:21:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:28,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:28,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:28,606 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:28,608 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-03 02:21:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:28,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:21:28,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:28,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:21:28,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:21:28,827 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-03 02:21:28,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:28,827 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:28,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36053959] [2022-11-03 02:21:28,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36053959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:28,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:28,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:21:28,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648346006] [2022-11-03 02:21:28,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:28,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:21:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:28,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:21:28,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:21:28,830 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 02:21:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:29,188 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2022-11-03 02:21:29,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:21:29,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-03 02:21:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:29,190 INFO L225 Difference]: With dead ends: 163 [2022-11-03 02:21:29,190 INFO L226 Difference]: Without dead ends: 163 [2022-11-03 02:21:29,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-03 02:21:29,191 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 19 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:29,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 280 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:21:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-03 02:21:29,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2022-11-03 02:21:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 125 states have (on average 1.36) internal successors, (170), 158 states have internal predecessors, (170), 0 states have call successors, (0), 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-03 02:21:29,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2022-11-03 02:21:29,196 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 24 [2022-11-03 02:21:29,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:29,197 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2022-11-03 02:21:29,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 02:21:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2022-11-03 02:21:29,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:21:29,198 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:29,198 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-03 02:21:29,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-11-03 02:21:29,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:29,413 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:29,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:29,414 INFO L85 PathProgramCache]: Analyzing trace with hash -433833013, now seen corresponding path program 1 times [2022-11-03 02:21:29,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:29,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384822758] [2022-11-03 02:21:29,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:29,415 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:29,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:29,416 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:29,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-03 02:21:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:29,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-03 02:21:29,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:29,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:21:29,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:29,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-03 02:21:29,681 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-03 02:21:29,681 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:29,681 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:29,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384822758] [2022-11-03 02:21:29,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384822758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:29,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:29,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:21:29,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012119721] [2022-11-03 02:21:29,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:29,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:21:29,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:29,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:21:29,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:29,684 INFO L87 Difference]: Start difference. First operand 159 states and 170 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-03 02:21:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:30,260 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-11-03 02:21:30,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 02:21:30,260 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-03 02:21:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:30,261 INFO L225 Difference]: With dead ends: 158 [2022-11-03 02:21:30,261 INFO L226 Difference]: Without dead ends: 158 [2022-11-03 02:21:30,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:30,262 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:30,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 309 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:21:30,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-03 02:21:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-11-03 02:21:30,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.352) internal successors, (169), 157 states have internal predecessors, (169), 0 states have call successors, (0), 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-03 02:21:30,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2022-11-03 02:21:30,267 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 26 [2022-11-03 02:21:30,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:30,267 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2022-11-03 02:21:30,268 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-03 02:21:30,268 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-11-03 02:21:30,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 02:21:30,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:30,268 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-03 02:21:30,285 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-11-03 02:21:30,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:30,481 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash -433833012, now seen corresponding path program 1 times [2022-11-03 02:21:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:30,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175670779] [2022-11-03 02:21:30,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:30,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:30,482 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:30,483 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:30,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-03 02:21:30,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:30,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:21:30,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:30,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:21:30,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:30,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:30,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-03 02:21:30,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:30,777 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-03 02:21:30,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:30,778 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:30,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175670779] [2022-11-03 02:21:30,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175670779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:30,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:30,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:21:30,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448229226] [2022-11-03 02:21:30,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:30,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:21:30,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:30,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:21:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:30,781 INFO L87 Difference]: Start difference. First operand 158 states and 169 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-03 02:21:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:31,441 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-11-03 02:21:31,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 02:21:31,442 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-03 02:21:31,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:31,443 INFO L225 Difference]: With dead ends: 157 [2022-11-03 02:21:31,443 INFO L226 Difference]: Without dead ends: 157 [2022-11-03 02:21:31,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-03 02:21:31,444 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:31,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 299 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:21:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-03 02:21:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-03 02:21:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 125 states have (on average 1.344) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 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-03 02:21:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2022-11-03 02:21:31,449 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 26 [2022-11-03 02:21:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:31,450 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2022-11-03 02:21:31,450 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-03 02:21:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-11-03 02:21:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-03 02:21:31,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:31,451 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-03 02:21:31,466 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-11-03 02:21:31,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:31,666 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:31,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:31,667 INFO L85 PathProgramCache]: Analyzing trace with hash -83332022, now seen corresponding path program 1 times [2022-11-03 02:21:31,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:31,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758402799] [2022-11-03 02:21:31,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:31,667 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:31,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:31,669 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:31,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-03 02:21:31,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:31,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:21:31,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:31,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:31,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:32,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:32,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-03 02:21:32,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:32,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:32,120 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-03 02:21:32,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:32,120 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:32,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758402799] [2022-11-03 02:21:32,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758402799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:32,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:32,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-03 02:21:32,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58137480] [2022-11-03 02:21:32,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:32,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 02:21:32,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:32,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 02:21:32,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:21:32,122 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 5 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-03 02:21:32,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:32,616 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-11-03 02:21:32,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:21:32,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 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-03 02:21:32,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:32,619 INFO L225 Difference]: With dead ends: 156 [2022-11-03 02:21:32,619 INFO L226 Difference]: Without dead ends: 156 [2022-11-03 02:21:32,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-03 02:21:32,620 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 96 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:32,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 228 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:21:32,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-03 02:21:32,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2022-11-03 02:21:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.3306451612903225) internal successors, (165), 154 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 02:21:32,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2022-11-03 02:21:32,624 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 27 [2022-11-03 02:21:32,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:32,625 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2022-11-03 02:21:32,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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-03 02:21:32,625 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2022-11-03 02:21:32,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 02:21:32,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:32,626 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, 1, 1] [2022-11-03 02:21:32,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:32,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:32,837 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:32,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:32,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1522435470, now seen corresponding path program 1 times [2022-11-03 02:21:32,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:32,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [666503845] [2022-11-03 02:21:32,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:32,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:32,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:32,840 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:32,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-03 02:21:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:33,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 02:21:33,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:33,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-03 02:21:33,207 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-03 02:21:33,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-03 02:21:33,286 INFO L356 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-03 02:21:33,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-03 02:21:33,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:33,401 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:21:33,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 02:21:33,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-03 02:21:33,477 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-03 02:21:33,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:33,478 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:33,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [666503845] [2022-11-03 02:21:33,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [666503845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:33,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:33,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-03 02:21:33,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050387464] [2022-11-03 02:21:33,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:33,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 02:21:33,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:33,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 02:21:33,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:21:33,480 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:35,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:35,049 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2022-11-03 02:21:35,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 02:21:35,050 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 02:21:35,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:35,051 INFO L225 Difference]: With dead ends: 169 [2022-11-03 02:21:35,051 INFO L226 Difference]: Without dead ends: 169 [2022-11-03 02:21:35,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2022-11-03 02:21:35,052 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 186 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:35,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 314 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-03 02:21:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-03 02:21:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2022-11-03 02:21:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 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-03 02:21:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2022-11-03 02:21:35,057 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 29 [2022-11-03 02:21:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:35,057 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2022-11-03 02:21:35,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:21:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2022-11-03 02:21:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:21:35,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:35,059 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, 1, 1, 1] [2022-11-03 02:21:35,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:35,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:35,273 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:35,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -296461252, now seen corresponding path program 1 times [2022-11-03 02:21:35,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:35,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440309947] [2022-11-03 02:21:35,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:35,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:35,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:35,275 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:35,276 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-03 02:21:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:35,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 02:21:35,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:35,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 02:21:35,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-03 02:21:35,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:21:35,521 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:35,521 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:35,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440309947] [2022-11-03 02:21:35,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440309947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:35,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:35,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 02:21:35,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807197713] [2022-11-03 02:21:35,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:35,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:21:35,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:21:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:21:35,523 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 02:21:35,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:35,796 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2022-11-03 02:21:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 02:21:35,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-03 02:21:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:35,798 INFO L225 Difference]: With dead ends: 165 [2022-11-03 02:21:35,798 INFO L226 Difference]: Without dead ends: 165 [2022-11-03 02:21:35,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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-03 02:21:35,799 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 7 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:35,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 282 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:21:35,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-03 02:21:35,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2022-11-03 02:21:35,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.31496062992126) internal successors, (167), 157 states have internal predecessors, (167), 0 states have call successors, (0), 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-03 02:21:35,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2022-11-03 02:21:35,804 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 30 [2022-11-03 02:21:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:35,805 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2022-11-03 02:21:35,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 02:21:35,805 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2022-11-03 02:21:35,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:21:35,806 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:35,806 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, 1, 1, 1] [2022-11-03 02:21:35,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:36,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:36,020 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:36,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash -275466542, now seen corresponding path program 1 times [2022-11-03 02:21:36,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:36,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758300823] [2022-11-03 02:21:36,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:36,021 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:36,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:36,022 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:36,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-03 02:21:36,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:36,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-03 02:21:36,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:36,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 02:21:36,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:36,241 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:36,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1758300823] [2022-11-03 02:21:36,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1758300823] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:36,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:36,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:21:36,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867864280] [2022-11-03 02:21:36,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:36,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:21:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:36,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:21:36,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:21:36,243 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 02:21:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:36,364 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2022-11-03 02:21:36,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:21:36,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-03 02:21:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:36,366 INFO L225 Difference]: With dead ends: 160 [2022-11-03 02:21:36,366 INFO L226 Difference]: Without dead ends: 160 [2022-11-03 02:21:36,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-03 02:21:36,367 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 70 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:36,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 124 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:21:36,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-03 02:21:36,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-03 02:21:36,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 129 states have (on average 1.310077519379845) internal successors, (169), 159 states have internal predecessors, (169), 0 states have call successors, (0), 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-03 02:21:36,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2022-11-03 02:21:36,371 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 30 [2022-11-03 02:21:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:36,372 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2022-11-03 02:21:36,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 02:21:36,372 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2022-11-03 02:21:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:21:36,372 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:36,372 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, 1, 1, 1] [2022-11-03 02:21:36,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:36,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:36,587 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:36,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2127502605, now seen corresponding path program 1 times [2022-11-03 02:21:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:36,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581457166] [2022-11-03 02:21:36,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:36,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:36,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:36,589 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:36,592 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-03 02:21:36,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:36,980 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-03 02:21:36,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:37,022 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-03 02:21:37,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-03 02:21:37,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:37,168 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:21:37,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-03 02:21:37,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-03 02:21:37,243 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-03 02:21:37,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:37,243 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:37,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581457166] [2022-11-03 02:21:37,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581457166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:37,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:37,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:21:37,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798667621] [2022-11-03 02:21:37,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:37,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:21:37,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:37,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:21:37,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:21:37,246 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 02:21:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:37,684 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2022-11-03 02:21:37,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 02:21:37,686 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-03 02:21:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:37,686 INFO L225 Difference]: With dead ends: 160 [2022-11-03 02:21:37,687 INFO L226 Difference]: Without dead ends: 160 [2022-11-03 02:21:37,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-03 02:21:37,688 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 54 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:37,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 239 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 148 Invalid, 0 Unknown, 90 Unchecked, 0.4s Time] [2022-11-03 02:21:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-03 02:21:37,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-11-03 02:21:37,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 129 states have (on average 1.302325581395349) internal successors, (168), 158 states have internal predecessors, (168), 0 states have call successors, (0), 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-03 02:21:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2022-11-03 02:21:37,692 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 30 [2022-11-03 02:21:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:37,692 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2022-11-03 02:21:37,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 02:21:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2022-11-03 02:21:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 02:21:37,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:37,694 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, 1, 1, 1] [2022-11-03 02:21:37,710 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:37,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:37,910 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:37,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:37,910 INFO L85 PathProgramCache]: Analyzing trace with hash 2127502606, now seen corresponding path program 1 times [2022-11-03 02:21:37,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:37,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [242015373] [2022-11-03 02:21:37,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:37,911 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:37,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:37,912 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:37,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-03 02:21:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:38,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-03 02:21:38,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:38,225 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-03 02:21:38,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-03 02:21:38,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:21:38,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:38,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-03 02:21:38,388 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 02:21:38,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-03 02:21:38,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-03 02:21:38,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-03 02:21:38,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:38,479 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-03 02:21:38,480 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 02:21:38,480 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:38,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [242015373] [2022-11-03 02:21:38,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [242015373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:21:38,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:21:38,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-03 02:21:38,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929213544] [2022-11-03 02:21:38,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:21:38,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:21:38,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:38,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:21:38,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:21:38,482 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 02:21:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:39,776 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-11-03 02:21:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:21:39,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2022-11-03 02:21:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:39,777 INFO L225 Difference]: With dead ends: 155 [2022-11-03 02:21:39,777 INFO L226 Difference]: Without dead ends: 155 [2022-11-03 02:21:39,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-03 02:21:39,778 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:39,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 385 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-11-03 02:21:39,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-03 02:21:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-11-03 02:21:39,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.256198347107438) internal successors, (152), 143 states have internal predecessors, (152), 0 states have call successors, (0), 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-03 02:21:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2022-11-03 02:21:39,783 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 30 [2022-11-03 02:21:39,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:39,783 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2022-11-03 02:21:39,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 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-03 02:21:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-11-03 02:21:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-03 02:21:39,784 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:39,784 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:39,801 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (26)] Ended with exit code 0 [2022-11-03 02:21:39,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:39,997 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1259070453, now seen corresponding path program 1 times [2022-11-03 02:21:39,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:39,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238612890] [2022-11-03 02:21:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:39,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:39,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:39,999 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:40,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-11-03 02:21:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:40,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 02:21:40,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:40,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:40,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:40,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:40,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:21:40,796 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-03 02:21:40,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-11-03 02:21:40,814 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-03 02:21:40,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-03 02:21:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:40,901 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-03 02:21:40,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238612890] [2022-11-03 02:21:40,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238612890] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:21:40,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [930956879] [2022-11-03 02:21:40,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:40,901 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-03 02:21:40,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 [2022-11-03 02:21:40,903 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-03 02:21:40,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2022-11-03 02:21:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:41,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-03 02:21:41,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:41,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:21:41,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:41,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:41,382 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:41,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:21:41,748 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-03 02:21:41,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:21:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:41,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [930956879] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:21:41,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401876425] [2022-11-03 02:21:41,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:41,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:21:41,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:21:41,901 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 02:21:41,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-11-03 02:21:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:21:42,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-03 02:21:42,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 02:21:42,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 02:21:42,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:42,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-03 02:21:42,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:42,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 02:21:42,331 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-03 02:21:42,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-03 02:21:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:21:42,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401876425] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 02:21:42,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-03 02:21:42,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9, 10, 9, 9] total 25 [2022-11-03 02:21:42,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756957048] [2022-11-03 02:21:42,384 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-03 02:21:42,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-03 02:21:42,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-03 02:21:42,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-03 02:21:42,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2022-11-03 02:21:42,385 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 0 states have call successors, (0), 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-03 02:21:45,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:21:45,632 INFO L93 Difference]: Finished difference Result 196 states and 208 transitions. [2022-11-03 02:21:45,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-03 02:21:45,633 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 0 states have call successors, (0), 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 33 [2022-11-03 02:21:45,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:21:45,634 INFO L225 Difference]: With dead ends: 196 [2022-11-03 02:21:45,634 INFO L226 Difference]: Without dead ends: 196 [2022-11-03 02:21:45,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=888, Unknown=0, NotChecked=0, Total=1056 [2022-11-03 02:21:45,635 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 329 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 1261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-03 02:21:45,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 788 Invalid, 1261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 1203 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-03 02:21:45,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-03 02:21:45,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 155. [2022-11-03 02:21:45,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.25) internal successors, (165), 154 states have internal predecessors, (165), 0 states have call successors, (0), 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-03 02:21:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2022-11-03 02:21:45,639 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 33 [2022-11-03 02:21:45,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:21:45,640 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2022-11-03 02:21:45,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.4) internal successors, (85), 25 states have internal predecessors, (85), 0 states have call successors, (0), 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-03 02:21:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2022-11-03 02:21:45,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-03 02:21:45,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:21:45,641 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:21:45,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:45,864 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:46,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:46,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3,28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/cvc4 --incremental --print-success --lang smt,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 02:21:46,256 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-03 02:21:46,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:21:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash 376478029, now seen corresponding path program 1 times [2022-11-03 02:21:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-03 02:21:46,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109327252] [2022-11-03 02:21:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:21:46,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-03 02:21:46,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat [2022-11-03 02:21:46,259 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-03 02:21:46,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-11-03 02:21:46,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:21:46,563 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:21:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:21:46,759 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-11-03 02:21:46,759 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:21:46,761 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2022-11-03 02:21:46,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2022-11-03 02:21:46,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2022-11-03 02:21:46,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2022-11-03 02:21:46,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2022-11-03 02:21:46,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2022-11-03 02:21:46,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2022-11-03 02:21:46,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2022-11-03 02:21:46,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2022-11-03 02:21:46,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2022-11-03 02:21:46,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2022-11-03 02:21:46,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2022-11-03 02:21:46,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2022-11-03 02:21:46,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2022-11-03 02:21:46,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2022-11-03 02:21:46,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2022-11-03 02:21:46,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2022-11-03 02:21:46,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2022-11-03 02:21:46,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2022-11-03 02:21:46,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2022-11-03 02:21:46,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2022-11-03 02:21:46,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2022-11-03 02:21:46,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2022-11-03 02:21:46,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2022-11-03 02:21:46,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2022-11-03 02:21:46,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2022-11-03 02:21:46,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2022-11-03 02:21:46,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2022-11-03 02:21:46,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2022-11-03 02:21:46,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2022-11-03 02:21:46,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2022-11-03 02:21:46,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2022-11-03 02:21:46,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2022-11-03 02:21:46,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2022-11-03 02:21:46,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2022-11-03 02:21:46,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2022-11-03 02:21:46,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2022-11-03 02:21:46,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2022-11-03 02:21:46,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2022-11-03 02:21:46,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2022-11-03 02:21:46,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2022-11-03 02:21:46,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (35 of 77 remaining) [2022-11-03 02:21:46,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2022-11-03 02:21:46,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 77 remaining) [2022-11-03 02:21:46,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (32 of 77 remaining) [2022-11-03 02:21:46,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (31 of 77 remaining) [2022-11-03 02:21:46,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (30 of 77 remaining) [2022-11-03 02:21:46,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2022-11-03 02:21:46,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2022-11-03 02:21:46,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (27 of 77 remaining) [2022-11-03 02:21:46,773 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2022-11-03 02:21:46,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2022-11-03 02:21:46,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2022-11-03 02:21:46,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2022-11-03 02:21:46,774 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (22 of 77 remaining) [2022-11-03 02:21:46,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2022-11-03 02:21:46,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2022-11-03 02:21:46,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (19 of 77 remaining) [2022-11-03 02:21:46,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2022-11-03 02:21:46,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2022-11-03 02:21:46,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2022-11-03 02:21:46,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2022-11-03 02:21:46,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2022-11-03 02:21:46,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2022-11-03 02:21:46,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (12 of 77 remaining) [2022-11-03 02:21:46,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (11 of 77 remaining) [2022-11-03 02:21:46,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (10 of 77 remaining) [2022-11-03 02:21:46,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2022-11-03 02:21:46,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2022-11-03 02:21:46,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (7 of 77 remaining) [2022-11-03 02:21:46,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (6 of 77 remaining) [2022-11-03 02:21:46,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (5 of 77 remaining) [2022-11-03 02:21:46,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2022-11-03 02:21:46,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2022-11-03 02:21:46,778 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (2 of 77 remaining) [2022-11-03 02:21:46,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE (1 of 77 remaining) [2022-11-03 02:21:46,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (0 of 77 remaining) [2022-11-03 02:21:46,801 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-11-03 02:21:46,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/mathsat -unsat_core_generation=3 [2022-11-03 02:21:46,993 INFO L444 BasicCegarLoop]: Path program 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] [2022-11-03 02:21:46,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:21:47,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:21:47 BoogieIcfgContainer [2022-11-03 02:21:47,048 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:21:47,049 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:21:47,049 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:21:47,049 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:21:47,050 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:21:05" (3/4) ... [2022-11-03 02:21:47,053 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-03 02:21:47,053 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:21:47,054 INFO L158 Benchmark]: Toolchain (without parser) took 43735.68ms. Allocated memory was 69.2MB in the beginning and 102.8MB in the end (delta: 33.6MB). Free memory was 49.6MB in the beginning and 23.9MB in the end (delta: 25.7MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2022-11-03 02:21:47,055 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 69.2MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:21:47,055 INFO L158 Benchmark]: CACSL2BoogieTranslator took 695.61ms. Allocated memory is still 69.2MB. Free memory was 49.4MB in the beginning and 43.4MB in the end (delta: 5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-03 02:21:47,056 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.66ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 41.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:21:47,056 INFO L158 Benchmark]: Boogie Preprocessor took 72.80ms. Allocated memory is still 69.2MB. Free memory was 41.4MB in the beginning and 39.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:21:47,057 INFO L158 Benchmark]: RCFGBuilder took 1183.52ms. Allocated memory is still 69.2MB. Free memory was 39.0MB in the beginning and 29.0MB in the end (delta: 10.0MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2022-11-03 02:21:47,057 INFO L158 Benchmark]: TraceAbstraction took 41712.42ms. Allocated memory was 69.2MB in the beginning and 102.8MB in the end (delta: 33.6MB). Free memory was 28.4MB in the beginning and 25.0MB in the end (delta: 3.4MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2022-11-03 02:21:47,057 INFO L158 Benchmark]: Witness Printer took 4.79ms. Allocated memory is still 102.8MB. Free memory was 25.0MB in the beginning and 23.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:21:47,059 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 69.2MB. Free memory was 50.5MB in the beginning and 50.4MB in the end (delta: 49.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 695.61ms. Allocated memory is still 69.2MB. Free memory was 49.4MB in the beginning and 43.4MB in the end (delta: 5.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.66ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 41.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.80ms. Allocated memory is still 69.2MB. Free memory was 41.4MB in the beginning and 39.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1183.52ms. Allocated memory is still 69.2MB. Free memory was 39.0MB in the beginning and 29.0MB in the end (delta: 10.0MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * TraceAbstraction took 41712.42ms. Allocated memory was 69.2MB in the beginning and 102.8MB in the end (delta: 33.6MB). Free memory was 28.4MB in the beginning and 25.0MB in the end (delta: 3.4MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. * Witness Printer took 4.79ms. Allocated memory is still 102.8MB. Free memory was 25.0MB in the beginning and 23.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={-2147483647:0}] [L1000] null->prev = ((void*)0) VAL [null={-2147483647:0}] [L1001] null->colour = BLACK VAL [null={-2147483647:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={3:0}, null={-2147483647:0}] [L1005] list->prev = null VAL [list={3:0}, null={-2147483647:0}] [L1006] list->colour = BLACK VAL [list={3:0}, null={-2147483647:0}] [L1008] struct TSLL* end = list; VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1042] EXPR end->colour VAL [end={3:0}, end->colour=1, list={3:0}, null={-2147483647:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1045] EXPR end->colour VAL [end={3:0}, end->colour=1, list={3:0}, null={-2147483647:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={3:0}, end->next={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1056] COND TRUE null != list VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1058] EXPR list->colour VAL [end={-2147483647:0}, list={3:0}, list->colour=1, null={-2147483647:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={-2147483647:0}, list={3:0}, list->next={-2147483647:0}, null={-2147483647:0}] [L1067] end = list->next [L1068] free(list) VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1068] free(list) VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1068] free(list) [L1069] list = end VAL [end={-2147483647:0}, list={-2147483647:0}, null={-2147483647:0}] [L1056] COND FALSE !(null != list) VAL [end={-2147483647:0}, list={-2147483647:0}, null={-2147483647:0}] [L1073] return 0; VAL [\result=0, end={-2147483647:0}, list={-2147483647:0}, null={-2147483647:0}] - 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: -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: -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: -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: -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: 1032]: 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: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: 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: 1042]: 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: 1048]: 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: 1049]: 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: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free 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: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free 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: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 164 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 41.6s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3820 SdHoareTripleChecker+Valid, 18.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3820 mSDsluCounter, 6634 SdHoareTripleChecker+Invalid, 16.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 199 IncrementalHoareTripleChecker+Unchecked, 4456 mSDsCounter, 441 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6530 IncrementalHoareTripleChecker+Invalid, 7170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 441 mSolverCounterUnsat, 2178 mSDtfsCounter, 6530 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 814 GetRequests, 607 SyntacticMatches, 3 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 5.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=0, InterpolantAutomatonStates: 186, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 380 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 624 NumberOfCodeBlocks, 624 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 727 ConstructedInterpolants, 4 QuantifiedInterpolants, 5464 SizeOfPredicates, 140 NumberOfNonLiveVariables, 4143 ConjunctsInSsa, 310 ConjunctsInUnsatCore, 34 InterpolantComputations, 22 PerfectInterpolantSequences, 12/32 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-03 02:21:47,131 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ecf4049-15aa-4155-853b-55669f416b03/bin/utaipan-7li7fVZpFI/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