./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 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_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh --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 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- 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-2329fc7 [2022-12-14 07:40:32,965 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:40:32,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:40:32,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:40:32,979 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:40:32,980 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:40:32,981 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:40:32,982 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:40:32,982 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:40:32,983 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:40:32,984 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:40:32,984 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:40:32,985 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:40:32,985 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:40:32,986 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:40:32,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:40:32,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:40:32,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:40:32,989 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:40:32,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:40:32,991 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:40:32,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:40:32,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:40:32,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:40:32,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:40:32,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:40:32,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:40:32,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:40:32,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:40:32,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:40:32,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:40:32,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:40:32,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:40:32,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:40:33,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:40:33,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:40:33,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:40:33,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:40:33,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:40:33,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:40:33,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:40:33,003 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-12-14 07:40:33,019 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:40:33,019 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:40:33,019 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:40:33,019 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:40:33,020 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:40:33,020 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:40:33,020 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:40:33,020 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:40:33,021 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:40:33,021 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 07:40:33,021 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:40:33,021 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:40:33,021 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 07:40:33,021 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 07:40:33,021 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:40:33,022 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 07:40:33,022 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 07:40:33,022 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 07:40:33,022 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 07:40:33,023 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 07:40:33,023 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:40:33,023 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:40:33,023 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:40:33,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:40:33,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:40:33,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:40:33,024 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 07:40:33,024 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 07:40:33,024 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 07:40:33,024 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:40:33,025 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 07:40:33,025 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:40:33,025 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:40:33,025 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:40:33,025 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:40:33,025 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:40:33,026 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:40:33,026 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 07:40:33,026 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:40:33,026 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 07:40:33,026 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 07:40:33,026 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:40:33,027 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_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/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_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2022-12-14 07:40:33,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:40:33,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:40:33,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:40:33,215 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:40:33,215 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:40:33,217 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-12-14 07:40:35,743 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:40:35,963 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:40:35,963 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-12-14 07:40:35,973 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/data/db5cb5f84/6086eaaedc37494e8d8e1a7acd947212/FLAG08babdd23 [2022-12-14 07:40:36,319 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/data/db5cb5f84/6086eaaedc37494e8d8e1a7acd947212 [2022-12-14 07:40:36,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:40:36,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:40:36,328 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:40:36,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:40:36,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:40:36,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,335 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc9d457 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36, skipping insertion in model container [2022-12-14 07:40:36,335 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:40:36,365 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:40:36,535 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2022-12-14 07:40:36,539 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2022-12-14 07:40:36,540 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2022-12-14 07:40:36,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:40:36,551 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:40:36,575 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2022-12-14 07:40:36,576 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2022-12-14 07:40:36,577 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2022-12-14 07:40:36,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:40:36,595 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:40:36,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36 WrapperNode [2022-12-14 07:40:36,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:40:36,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:40:36,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:40:36,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:40:36,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,610 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,625 INFO L138 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 128 [2022-12-14 07:40:36,625 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:40:36,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:40:36,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:40:36,626 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:40:36,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,646 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,651 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,652 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,654 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:40:36,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:40:36,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:40:36,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:40:36,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (1/1) ... [2022-12-14 07:40:36,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:40:36,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:40:36,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:40:36,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:40:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 07:40:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 07:40:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:40:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:40:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 07:40:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 07:40:36,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:40:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 07:40:36,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:40:36,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:40:36,801 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:40:36,802 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:40:37,112 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:40:37,152 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:40:37,152 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 07:40:37,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:40:37 BoogieIcfgContainer [2022-12-14 07:40:37,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:40:37,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:40:37,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:40:37,158 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:40:37,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:40:36" (1/3) ... [2022-12-14 07:40:37,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44981a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:40:37, skipping insertion in model container [2022-12-14 07:40:37,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:36" (2/3) ... [2022-12-14 07:40:37,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44981a19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:40:37, skipping insertion in model container [2022-12-14 07:40:37,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:40:37" (3/3) ... [2022-12-14 07:40:37,161 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2022-12-14 07:40:37,176 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:40:37,176 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-12-14 07:40:37,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:40:37,216 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;@36223064, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:40:37,217 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-12-14 07:40:37,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 54 states have (on average 2.5) internal successors, (135), 119 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-12-14 07:40:37,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 07:40:37,224 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:37,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 07:40:37,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:37,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:37,229 INFO L85 PathProgramCache]: Analyzing trace with hash 8095, now seen corresponding path program 1 times [2022-12-14 07:40:37,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:37,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511255188] [2022-12-14 07:40:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:37,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:37,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:37,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511255188] [2022-12-14 07:40:37,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511255188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:37,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:37,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:40:37,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948691309] [2022-12-14 07:40:37,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:37,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:40:37,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:40:37,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:40:37,426 INFO L87 Difference]: Start difference. First operand has 120 states, 54 states have (on average 2.5) internal successors, (135), 119 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) 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-12-14 07:40:37,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:37,549 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2022-12-14 07:40:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:40:37,552 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-12-14 07:40:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:37,558 INFO L225 Difference]: With dead ends: 119 [2022-12-14 07:40:37,559 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 07:40:37,560 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-12-14 07:40:37,563 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:37,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:37,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 07:40:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2022-12-14 07:40:37,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 56 states have (on average 2.1607142857142856) internal successors, (121), 113 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:37,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2022-12-14 07:40:37,594 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 2 [2022-12-14 07:40:37,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:37,595 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2022-12-14 07:40:37,595 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-12-14 07:40:37,595 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2022-12-14 07:40:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 07:40:37,595 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:37,595 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 07:40:37,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 07:40:37,596 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:37,597 INFO L85 PathProgramCache]: Analyzing trace with hash 8096, now seen corresponding path program 1 times [2022-12-14 07:40:37,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:37,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760690350] [2022-12-14 07:40:37,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:37,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:37,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:37,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:37,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760690350] [2022-12-14 07:40:37,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760690350] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:37,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:37,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 07:40:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142011070] [2022-12-14 07:40:37,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:37,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:40:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:37,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:40:37,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:40:37,677 INFO L87 Difference]: Start difference. First operand 114 states and 121 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-12-14 07:40:37,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:37,779 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2022-12-14 07:40:37,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:40:37,780 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-12-14 07:40:37,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:37,781 INFO L225 Difference]: With dead ends: 127 [2022-12-14 07:40:37,781 INFO L226 Difference]: Without dead ends: 127 [2022-12-14 07:40:37,781 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-12-14 07:40:37,782 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 97 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:37,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 64 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:37,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-12-14 07:40:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 116. [2022-12-14 07:40:37,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 115 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:37,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2022-12-14 07:40:37,790 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 2 [2022-12-14 07:40:37,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:37,790 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2022-12-14 07:40:37,791 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-12-14 07:40:37,791 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-12-14 07:40:37,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:40:37,791 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:37,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:37,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 07:40:37,792 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:37,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:37,792 INFO L85 PathProgramCache]: Analyzing trace with hash -191356527, now seen corresponding path program 1 times [2022-12-14 07:40:37,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:37,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894384328] [2022-12-14 07:40:37,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:37,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:37,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:37,966 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:37,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894384328] [2022-12-14 07:40:37,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894384328] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:37,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:37,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:40:37,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092975014] [2022-12-14 07:40:37,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:37,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:40:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:37,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:40:37,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:40:37,969 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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-12-14 07:40:38,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:38,089 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2022-12-14 07:40:38,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:40:38,089 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-12-14 07:40:38,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:38,090 INFO L225 Difference]: With dead ends: 117 [2022-12-14 07:40:38,090 INFO L226 Difference]: Without dead ends: 117 [2022-12-14 07:40:38,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:38,092 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 155 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:38,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 44 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:38,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-14 07:40:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 106. [2022-12-14 07:40:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 64 states have (on average 1.8125) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:38,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-12-14 07:40:38,099 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 7 [2022-12-14 07:40:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:38,099 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-12-14 07:40:38,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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-12-14 07:40:38,100 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-12-14 07:40:38,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 07:40:38,100 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:38,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:38,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 07:40:38,101 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:38,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:38,101 INFO L85 PathProgramCache]: Analyzing trace with hash -191356526, now seen corresponding path program 1 times [2022-12-14 07:40:38,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:38,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783117586] [2022-12-14 07:40:38,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:38,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:38,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:38,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:38,261 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:38,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783117586] [2022-12-14 07:40:38,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783117586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:38,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:38,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:40:38,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398971609] [2022-12-14 07:40:38,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:38,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:40:38,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:38,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:40:38,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:40:38,263 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-12-14 07:40:38,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:38,458 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-12-14 07:40:38,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:40:38,459 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-12-14 07:40:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:38,460 INFO L225 Difference]: With dead ends: 140 [2022-12-14 07:40:38,460 INFO L226 Difference]: Without dead ends: 140 [2022-12-14 07:40:38,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 07:40:38,461 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 142 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:38,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 81 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:40:38,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-12-14 07:40:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 117. [2022-12-14 07:40:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 116 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:38,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2022-12-14 07:40:38,467 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 7 [2022-12-14 07:40:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:38,468 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2022-12-14 07:40:38,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 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-12-14 07:40:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2022-12-14 07:40:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:40:38,468 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:38,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:38,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 07:40:38,469 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:38,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:38,469 INFO L85 PathProgramCache]: Analyzing trace with hash 789967275, now seen corresponding path program 1 times [2022-12-14 07:40:38,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:38,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226490461] [2022-12-14 07:40:38,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:38,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:38,513 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:38,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226490461] [2022-12-14 07:40:38,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226490461] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:38,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:38,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:40:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646871796] [2022-12-14 07:40:38,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:38,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:40:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:38,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:40:38,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:40:38,515 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:38,605 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-12-14 07:40:38,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:40:38,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 07:40:38,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:38,606 INFO L225 Difference]: With dead ends: 129 [2022-12-14 07:40:38,606 INFO L226 Difference]: Without dead ends: 129 [2022-12-14 07:40:38,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:38,607 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 120 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:38,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 105 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-12-14 07:40:38,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 115. [2022-12-14 07:40:38,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.6933333333333334) internal successors, (127), 114 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:38,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2022-12-14 07:40:38,613 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 9 [2022-12-14 07:40:38,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:38,613 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2022-12-14 07:40:38,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:38,613 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2022-12-14 07:40:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:40:38,614 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:38,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:38,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 07:40:38,614 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash 790171077, now seen corresponding path program 1 times [2022-12-14 07:40:38,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:38,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132212982] [2022-12-14 07:40:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:38,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:38,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:38,751 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:38,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132212982] [2022-12-14 07:40:38,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132212982] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:38,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:38,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:40:38,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997276889] [2022-12-14 07:40:38,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:38,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:40:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:38,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:40:38,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:38,752 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:38,870 INFO L93 Difference]: Finished difference Result 114 states and 125 transitions. [2022-12-14 07:40:38,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:40:38,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 07:40:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:38,870 INFO L225 Difference]: With dead ends: 114 [2022-12-14 07:40:38,870 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 07:40:38,871 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-12-14 07:40:38,871 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:38,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 07:40:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-12-14 07:40:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 75 states have (on average 1.6666666666666667) internal successors, (125), 113 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2022-12-14 07:40:38,877 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 9 [2022-12-14 07:40:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:38,877 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2022-12-14 07:40:38,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:38,877 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2022-12-14 07:40:38,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 07:40:38,878 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:38,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:38,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 07:40:38,878 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:38,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:38,878 INFO L85 PathProgramCache]: Analyzing trace with hash 790171076, now seen corresponding path program 1 times [2022-12-14 07:40:38,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:38,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007245347] [2022-12-14 07:40:38,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:38,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:38,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:38,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:38,937 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:38,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007245347] [2022-12-14 07:40:38,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007245347] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:38,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:38,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:40:38,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062893147] [2022-12-14 07:40:38,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:38,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:40:38,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:38,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:40:38,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:38,938 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:39,041 INFO L93 Difference]: Finished difference Result 113 states and 123 transitions. [2022-12-14 07:40:39,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:40:39,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-12-14 07:40:39,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:39,042 INFO L225 Difference]: With dead ends: 113 [2022-12-14 07:40:39,042 INFO L226 Difference]: Without dead ends: 113 [2022-12-14 07:40:39,042 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-12-14 07:40:39,043 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 4 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 208 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.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:39,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 208 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-12-14 07:40:39,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2022-12-14 07:40:39,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 75 states have (on average 1.64) internal successors, (123), 112 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:39,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2022-12-14 07:40:39,048 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 9 [2022-12-14 07:40:39,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:39,049 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2022-12-14 07:40:39,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:39,049 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2022-12-14 07:40:39,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:40:39,049 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:39,050 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:39,050 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 07:40:39,050 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:39,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:39,050 INFO L85 PathProgramCache]: Analyzing trace with hash -854603864, now seen corresponding path program 1 times [2022-12-14 07:40:39,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:39,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192501407] [2022-12-14 07:40:39,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:39,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:39,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:39,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:39,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:39,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192501407] [2022-12-14 07:40:39,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192501407] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:39,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:39,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-14 07:40:39,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676240448] [2022-12-14 07:40:39,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:39,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 07:40:39,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:39,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 07:40:39,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 07:40:39,192 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:39,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:39,404 INFO L93 Difference]: Finished difference Result 113 states and 122 transitions. [2022-12-14 07:40:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-14 07:40:39,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 07:40:39,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:39,405 INFO L225 Difference]: With dead ends: 113 [2022-12-14 07:40:39,405 INFO L226 Difference]: Without dead ends: 113 [2022-12-14 07:40:39,405 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-12-14 07:40:39,406 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 130 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:39,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 137 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:40:39,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-12-14 07:40:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2022-12-14 07:40:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 111 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-12-14 07:40:39,410 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 11 [2022-12-14 07:40:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:39,411 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-12-14 07:40:39,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-12-14 07:40:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:40:39,411 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:39,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:39,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 07:40:39,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:39,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:39,412 INFO L85 PathProgramCache]: Analyzing trace with hash -854603863, now seen corresponding path program 1 times [2022-12-14 07:40:39,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:39,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460828193] [2022-12-14 07:40:39,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:39,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:39,611 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:39,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460828193] [2022-12-14 07:40:39,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460828193] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:39,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:39,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:40:39,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423631566] [2022-12-14 07:40:39,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:39,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:40:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:40:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:40:39,612 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:39,929 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2022-12-14 07:40:39,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 07:40:39,929 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 07:40:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:39,930 INFO L225 Difference]: With dead ends: 114 [2022-12-14 07:40:39,930 INFO L226 Difference]: Without dead ends: 114 [2022-12-14 07:40:39,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-12-14 07:40:39,931 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 131 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:39,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 142 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:40:39,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-14 07:40:39,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 106. [2022-12-14 07:40:39,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 75 states have (on average 1.5466666666666666) internal successors, (116), 105 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:39,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2022-12-14 07:40:39,933 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 11 [2022-12-14 07:40:39,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:39,933 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2022-12-14 07:40:39,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:39,934 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2022-12-14 07:40:39,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 07:40:39,934 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:39,934 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:39,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 07:40:39,934 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:39,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1793276823, now seen corresponding path program 1 times [2022-12-14 07:40:39,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:39,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739243440] [2022-12-14 07:40:39,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:39,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:40,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:40,021 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:40,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739243440] [2022-12-14 07:40:40,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739243440] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:40,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:40,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:40:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871675430] [2022-12-14 07:40:40,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:40,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 07:40:40,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:40,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 07:40:40,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-14 07:40:40,022 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand has 6 states, 6 states have (on average 2.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-12-14 07:40:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:40,168 INFO L93 Difference]: Finished difference Result 161 states and 177 transitions. [2022-12-14 07:40:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:40:40,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.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-12-14 07:40:40,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:40,169 INFO L225 Difference]: With dead ends: 161 [2022-12-14 07:40:40,169 INFO L226 Difference]: Without dead ends: 161 [2022-12-14 07:40:40,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:40:40,170 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 199 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:40,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 162 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-12-14 07:40:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 113. [2022-12-14 07:40:40,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 112 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 124 transitions. [2022-12-14 07:40:40,174 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 124 transitions. Word has length 12 [2022-12-14 07:40:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:40,174 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 124 transitions. [2022-12-14 07:40:40,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.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-12-14 07:40:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 124 transitions. [2022-12-14 07:40:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 07:40:40,174 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:40,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:40,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 07:40:40,174 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:40,175 INFO L85 PathProgramCache]: Analyzing trace with hash -50027826, now seen corresponding path program 1 times [2022-12-14 07:40:40,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:40,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509423577] [2022-12-14 07:40:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:40,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:40,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:40,287 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:40,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509423577] [2022-12-14 07:40:40,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509423577] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:40,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:40,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:40:40,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729793734] [2022-12-14 07:40:40,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:40,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:40:40,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:40,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:40:40,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:40,288 INFO L87 Difference]: Start difference. First operand 113 states and 124 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:40,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:40,386 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-12-14 07:40:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:40:40,387 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 07:40:40,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:40,388 INFO L225 Difference]: With dead ends: 112 [2022-12-14 07:40:40,388 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 07:40:40,388 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-12-14 07:40:40,389 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:40,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 191 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:40,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 07:40:40,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-12-14 07:40:40,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 82 states have (on average 1.5) internal successors, (123), 111 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 123 transitions. [2022-12-14 07:40:40,391 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 123 transitions. Word has length 16 [2022-12-14 07:40:40,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:40,391 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 123 transitions. [2022-12-14 07:40:40,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:40,391 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 123 transitions. [2022-12-14 07:40:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-14 07:40:40,392 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:40,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:40,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-14 07:40:40,392 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:40,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash -50027825, now seen corresponding path program 1 times [2022-12-14 07:40:40,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:40,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670305688] [2022-12-14 07:40:40,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:40,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:40,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:40,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:40,521 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:40,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670305688] [2022-12-14 07:40:40,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670305688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:40,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:40,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:40:40,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644294942] [2022-12-14 07:40:40,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:40,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:40:40,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:40,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:40:40,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:40,523 INFO L87 Difference]: Start difference. First operand 112 states and 123 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:40,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:40,633 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-12-14 07:40:40,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:40:40,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-14 07:40:40,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:40,634 INFO L225 Difference]: With dead ends: 111 [2022-12-14 07:40:40,634 INFO L226 Difference]: Without dead ends: 111 [2022-12-14 07:40:40,635 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-12-14 07:40:40,635 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 1 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:40,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 183 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:40,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-14 07:40:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-12-14 07:40:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 110 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-12-14 07:40:40,638 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 16 [2022-12-14 07:40:40,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:40,639 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-12-14 07:40:40,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:40,639 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-12-14 07:40:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 07:40:40,639 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:40,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:40,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 07:40:40,640 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:40,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:40,640 INFO L85 PathProgramCache]: Analyzing trace with hash -2126705211, now seen corresponding path program 1 times [2022-12-14 07:40:40,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:40,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640591586] [2022-12-14 07:40:40,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:40,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:40,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:40,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:40,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 07:40:40,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640591586] [2022-12-14 07:40:40,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640591586] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:40,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:40,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:40:40,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608194017] [2022-12-14 07:40:40,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:40,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:40:40,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 07:40:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:40:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:40,726 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-12-14 07:40:40,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:40,823 INFO L93 Difference]: Finished difference Result 112 states and 121 transitions. [2022-12-14 07:40:40,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:40:40,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-12-14 07:40:40,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:40,824 INFO L225 Difference]: With dead ends: 112 [2022-12-14 07:40:40,824 INFO L226 Difference]: Without dead ends: 112 [2022-12-14 07:40:40,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-12-14 07:40:40,825 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:40,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 174 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 07:40:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-12-14 07:40:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-12-14 07:40:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.4814814814814814) internal successors, (120), 109 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-12-14 07:40:40,828 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 17 [2022-12-14 07:40:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:40,828 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-12-14 07:40:40,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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-12-14 07:40:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-12-14 07:40:40,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-14 07:40:40,829 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:40,829 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:40,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 07:40:40,829 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:40,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:40,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1503141088, now seen corresponding path program 1 times [2022-12-14 07:40:40,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 07:40:40,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129664573] [2022-12-14 07:40:40,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:40,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 07:40:40,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 07:40:40,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 07:40:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 07:40:40,864 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 07:40:40,865 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 07:40:40,865 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (64 of 65 remaining) [2022-12-14 07:40:40,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2022-12-14 07:40:40,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2022-12-14 07:40:40,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2022-12-14 07:40:40,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2022-12-14 07:40:40,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2022-12-14 07:40:40,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2022-12-14 07:40:40,867 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2022-12-14 07:40:40,868 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 65 remaining) [2022-12-14 07:40:40,869 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2022-12-14 07:40:40,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2022-12-14 07:40:40,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2022-12-14 07:40:40,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (31 of 65 remaining) [2022-12-14 07:40:40,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2022-12-14 07:40:40,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2022-12-14 07:40:40,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (28 of 65 remaining) [2022-12-14 07:40:40,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2022-12-14 07:40:40,870 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2022-12-14 07:40:40,871 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (13 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (12 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (11 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (8 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (7 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (6 of 65 remaining) [2022-12-14 07:40:40,872 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2022-12-14 07:40:40,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2022-12-14 07:40:40,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (3 of 65 remaining) [2022-12-14 07:40:40,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (2 of 65 remaining) [2022-12-14 07:40:40,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (1 of 65 remaining) [2022-12-14 07:40:40,873 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (0 of 65 remaining) [2022-12-14 07:40:40,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-14 07:40:40,876 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:40,878 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 07:40:40,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:40:40 BoogieIcfgContainer [2022-12-14 07:40:40,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 07:40:40,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 07:40:40,895 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 07:40:40,895 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 07:40:40,895 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:40:37" (3/4) ... [2022-12-14 07:40:40,897 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 07:40:40,897 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 07:40:40,898 INFO L158 Benchmark]: Toolchain (without parser) took 4571.71ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 86.9MB in the beginning and 44.0MB in the end (delta: 42.9MB). Peak memory consumption was 70.1MB. Max. memory is 16.1GB. [2022-12-14 07:40:40,898 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:40:40,898 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.44ms. Allocated memory is still 117.4MB. Free memory was 86.6MB in the beginning and 68.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 07:40:40,898 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.44ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:40:40,898 INFO L158 Benchmark]: Boogie Preprocessor took 28.50ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 64.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:40:40,899 INFO L158 Benchmark]: RCFGBuilder took 499.02ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 64.8MB in the beginning and 107.0MB in the end (delta: -42.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2022-12-14 07:40:40,899 INFO L158 Benchmark]: TraceAbstraction took 3738.66ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 44.0MB in the end (delta: 62.5MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. [2022-12-14 07:40:40,899 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 142.6MB. Free memory is still 44.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:40:40,900 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.18ms. Allocated memory is still 117.4MB. Free memory is still 92.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.44ms. Allocated memory is still 117.4MB. Free memory was 86.6MB in the beginning and 68.6MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.44ms. Allocated memory is still 117.4MB. Free memory was 68.6MB in the beginning and 66.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.50ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 64.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 499.02ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 64.8MB in the beginning and 107.0MB in the end (delta: -42.2MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3738.66ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 44.0MB in the end (delta: 62.5MB). Peak memory consumption was 63.5MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 142.6MB. Free memory is still 44.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: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={-1:0}] [L1007] list->prev = ((void*)0) VAL [list={-1:0}] [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={-1:0}, list={-1:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1041] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={-1:0}, list={-1:0}] [L1045] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={-1:0}, list={-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: 1040]: 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: 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: -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: 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. - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1103 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1103 mSDsluCounter, 1744 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1049 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2443 IncrementalHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 695 mSDtfsCounter, 2443 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 121 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 601 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 07:40:40,917 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/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_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh --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 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- 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-2329fc7 [2022-12-14 07:40:42,633 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 07:40:42,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 07:40:42,649 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 07:40:42,649 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 07:40:42,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 07:40:42,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 07:40:42,652 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 07:40:42,654 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 07:40:42,654 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 07:40:42,655 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 07:40:42,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 07:40:42,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 07:40:42,657 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 07:40:42,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 07:40:42,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 07:40:42,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 07:40:42,659 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 07:40:42,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 07:40:42,662 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 07:40:42,663 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 07:40:42,664 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 07:40:42,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 07:40:42,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 07:40:42,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 07:40:42,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 07:40:42,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 07:40:42,669 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 07:40:42,669 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 07:40:42,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 07:40:42,670 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 07:40:42,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 07:40:42,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 07:40:42,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 07:40:42,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 07:40:42,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 07:40:42,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 07:40:42,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 07:40:42,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 07:40:42,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 07:40:42,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 07:40:42,675 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2022-12-14 07:40:42,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 07:40:42,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 07:40:42,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 07:40:42,695 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 07:40:42,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 07:40:42,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 07:40:42,696 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 07:40:42,696 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 07:40:42,697 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 07:40:42,697 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 07:40:42,697 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 07:40:42,697 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 07:40:42,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 07:40:42,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 07:40:42,698 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 07:40:42,699 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 07:40:42,699 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 07:40:42,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 07:40:42,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 07:40:42,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 07:40:42,700 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 07:40:42,700 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 07:40:42,700 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 07:40:42,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 07:40:42,700 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 07:40:42,701 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-14 07:40:42,701 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-14 07:40:42,701 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 07:40:42,701 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 07:40:42,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 07:40:42,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-14 07:40:42,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 07:40:42,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:40:42,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 07:40:42,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 07:40:42,703 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-12-14 07:40:42,703 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-14 07:40:42,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 07:40:42,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-14 07:40:42,703 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_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/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_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2022-12-14 07:40:42,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 07:40:42,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 07:40:42,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 07:40:42,965 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 07:40:42,965 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 07:40:42,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-12-14 07:40:45,521 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 07:40:45,726 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 07:40:45,726 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-12-14 07:40:45,737 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/data/bf8ea5cc2/fdb7dff8f5bc4593851a3cb199b0a7c9/FLAG289df050f [2022-12-14 07:40:45,749 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/data/bf8ea5cc2/fdb7dff8f5bc4593851a3cb199b0a7c9 [2022-12-14 07:40:45,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 07:40:45,752 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 07:40:45,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 07:40:45,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 07:40:45,755 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 07:40:45,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:40:45" (1/1) ... [2022-12-14 07:40:45,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@548456e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:45, skipping insertion in model container [2022-12-14 07:40:45,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 07:40:45" (1/1) ... [2022-12-14 07:40:45,762 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 07:40:45,791 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 07:40:46,027 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2022-12-14 07:40:46,031 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2022-12-14 07:40:46,034 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2022-12-14 07:40:46,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:40:46,053 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 07:40:46,086 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22575,22588] [2022-12-14 07:40:46,087 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22647,22660] [2022-12-14 07:40:46,089 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i[22815,22828] [2022-12-14 07:40:46,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 07:40:46,120 INFO L208 MainTranslator]: Completed translation [2022-12-14 07:40:46,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46 WrapperNode [2022-12-14 07:40:46,121 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 07:40:46,122 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 07:40:46,122 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 07:40:46,122 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 07:40:46,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,156 INFO L138 Inliner]: procedures = 122, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2022-12-14 07:40:46,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 07:40:46,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 07:40:46,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 07:40:46,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 07:40:46,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,166 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,178 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,179 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,181 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 07:40:46,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 07:40:46,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 07:40:46,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 07:40:46,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (1/1) ... [2022-12-14 07:40:46,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 07:40:46,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 07:40:46,205 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 07:40:46,208 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 07:40:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-14 07:40:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-14 07:40:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 07:40:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-14 07:40:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-14 07:40:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 07:40:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-14 07:40:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-14 07:40:46,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 07:40:46,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 07:40:46,351 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 07:40:46,353 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 07:40:46,846 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 07:40:46,852 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 07:40:46,852 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-12-14 07:40:46,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:40:46 BoogieIcfgContainer [2022-12-14 07:40:46,854 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 07:40:46,856 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 07:40:46,856 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 07:40:46,858 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 07:40:46,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 07:40:45" (1/3) ... [2022-12-14 07:40:46,859 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b8bc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:40:46, skipping insertion in model container [2022-12-14 07:40:46,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 07:40:46" (2/3) ... [2022-12-14 07:40:46,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54b8bc52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 07:40:46, skipping insertion in model container [2022-12-14 07:40:46,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:40:46" (3/3) ... [2022-12-14 07:40:46,861 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2022-12-14 07:40:46,875 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 07:40:46,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-12-14 07:40:46,914 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 07:40:46,920 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;@531bcc2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 07:40:46,920 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-12-14 07:40:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:46,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:40:46,928 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:46,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:40:46,929 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:46,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:46,933 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-12-14 07:40:46,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:46,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356040897] [2022-12-14 07:40:46,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:46,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:46,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:46,948 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:46,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-14 07:40:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:46,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:40:47,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:47,052 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:47,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:47,063 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:47,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356040897] [2022-12-14 07:40:47,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356040897] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:47,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:47,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:40:47,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355346321] [2022-12-14 07:40:47,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:47,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:40:47,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:47,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:40:47,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:40:47,091 INFO L87 Difference]: Start difference. First operand has 136 states, 70 states have (on average 2.1857142857142855) internal successors, (153), 135 states have internal predecessors, (153), 0 states have call successors, (0), 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-12-14 07:40:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:47,337 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2022-12-14 07:40:47,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:40:47,339 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-12-14 07:40:47,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:47,347 INFO L225 Difference]: With dead ends: 137 [2022-12-14 07:40:47,348 INFO L226 Difference]: Without dead ends: 133 [2022-12-14 07:40:47,349 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-12-14 07:40:47,352 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:47,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 77 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:40:47,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-14 07:40:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2022-12-14 07:40:47,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 71 states have (on average 1.9154929577464788) internal successors, (136), 128 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-12-14 07:40:47,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 136 transitions. [2022-12-14 07:40:47,389 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 136 transitions. Word has length 3 [2022-12-14 07:40:47,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:47,389 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 136 transitions. [2022-12-14 07:40:47,389 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-12-14 07:40:47,389 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 136 transitions. [2022-12-14 07:40:47,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 07:40:47,389 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:47,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 07:40:47,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-14 07:40:47,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:47,592 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:47,594 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-12-14 07:40:47,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:47,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998664830] [2022-12-14 07:40:47,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:47,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:47,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:47,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:47,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-14 07:40:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:47,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-14 07:40:47,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:47,749 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:47,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:47,774 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:47,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998664830] [2022-12-14 07:40:47,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998664830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:47,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:47,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 07:40:47,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901426361] [2022-12-14 07:40:47,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:47,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 07:40:47,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:47,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 07:40:47,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 07:40:47,778 INFO L87 Difference]: Start difference. First operand 129 states and 136 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-12-14 07:40:48,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:48,020 INFO L93 Difference]: Finished difference Result 146 states and 152 transitions. [2022-12-14 07:40:48,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 07:40:48,020 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-12-14 07:40:48,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:48,021 INFO L225 Difference]: With dead ends: 146 [2022-12-14 07:40:48,021 INFO L226 Difference]: Without dead ends: 146 [2022-12-14 07:40:48,021 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-12-14 07:40:48,022 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 111 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:48,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 82 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:40:48,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-14 07:40:48,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2022-12-14 07:40:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 78 states have (on average 1.794871794871795) internal successors, (140), 132 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2022-12-14 07:40:48,028 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 3 [2022-12-14 07:40:48,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:48,028 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2022-12-14 07:40:48,028 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-12-14 07:40:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2022-12-14 07:40:48,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:40:48,028 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:48,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:48,036 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-14 07:40:48,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:48,230 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:48,232 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2022-12-14 07:40:48,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:48,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426216658] [2022-12-14 07:40:48,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:48,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:48,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:48,238 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:48,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-14 07:40:48,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:48,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-14 07:40:48,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:48,482 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:48,551 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-14 07:40:48,551 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:48,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:48,578 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:48,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426216658] [2022-12-14 07:40:48,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426216658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:48,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:48,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:40:48,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993279086] [2022-12-14 07:40:48,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:48,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:40:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:48,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:40:48,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:40:48,581 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:48,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:48,892 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-12-14 07:40:48,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 07:40:48,892 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-12-14 07:40:48,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:48,893 INFO L225 Difference]: With dead ends: 138 [2022-12-14 07:40:48,893 INFO L226 Difference]: Without dead ends: 138 [2022-12-14 07:40:48,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-12-14 07:40:48,894 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 183 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:48,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 63 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:40:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-14 07:40:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 123. [2022-12-14 07:40:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.6419753086419753) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-12-14 07:40:48,899 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 8 [2022-12-14 07:40:48,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:48,900 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-12-14 07:40:48,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:48,900 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-12-14 07:40:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 07:40:48,900 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:48,900 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:48,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-14 07:40:49,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:49,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:49,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:49,104 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2022-12-14 07:40:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:49,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066720299] [2022-12-14 07:40:49,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:49,106 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:49,106 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:49,109 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:49,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-14 07:40:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:49,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 07:40:49,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:49,301 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:49,374 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:40:49,375 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:49,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:49,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:49,390 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:49,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066720299] [2022-12-14 07:40:49,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066720299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:49,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:49,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 07:40:49,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254982270] [2022-12-14 07:40:49,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:49,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:40:49,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:49,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:40:49,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:40:49,392 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:49,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:49,745 INFO L93 Difference]: Finished difference Result 166 states and 177 transitions. [2022-12-14 07:40:49,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:40:49,746 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-12-14 07:40:49,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:49,746 INFO L225 Difference]: With dead ends: 166 [2022-12-14 07:40:49,747 INFO L226 Difference]: Without dead ends: 166 [2022-12-14 07:40:49,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-12-14 07:40:49,748 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 170 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:49,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 93 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:40:49,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-12-14 07:40:49,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 135. [2022-12-14 07:40:49,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.5851063829787233) internal successors, (149), 134 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-12-14 07:40:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2022-12-14 07:40:49,756 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 8 [2022-12-14 07:40:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:49,757 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2022-12-14 07:40:49,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2022-12-14 07:40:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 07:40:49,757 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:49,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:49,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-12-14 07:40:49,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:49,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:49,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1116012804, now seen corresponding path program 1 times [2022-12-14 07:40:49,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:49,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907022317] [2022-12-14 07:40:49,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:49,963 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:49,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:49,966 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:49,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-14 07:40:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:50,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-14 07:40:50,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:50,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:50,066 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:50,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907022317] [2022-12-14 07:40:50,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907022317] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:50,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:50,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:40:50,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663375482] [2022-12-14 07:40:50,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:50,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 07:40:50,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:50,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 07:40:50,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 07:40:50,067 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 4 states, 4 states have (on average 2.5) 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-12-14 07:40:50,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:50,302 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2022-12-14 07:40:50,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 07:40:50,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) 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-12-14 07:40:50,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:50,303 INFO L225 Difference]: With dead ends: 151 [2022-12-14 07:40:50,303 INFO L226 Difference]: Without dead ends: 151 [2022-12-14 07:40:50,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-12-14 07:40:50,304 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 142 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:50,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 142 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 07:40:50,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-14 07:40:50,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 133. [2022-12-14 07:40:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.5591397849462365) 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-12-14 07:40:50,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-12-14 07:40:50,311 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 10 [2022-12-14 07:40:50,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:50,311 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-12-14 07:40:50,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) 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-12-14 07:40:50,311 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-12-14 07:40:50,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:40:50,312 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:50,312 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:50,319 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-12-14 07:40:50,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:50,513 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:50,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:50,514 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2022-12-14 07:40:50,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:50,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21374414] [2022-12-14 07:40:50,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:50,514 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:50,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:50,516 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:50,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-14 07:40:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:50,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:40:50,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:50,591 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:50,603 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:50,618 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:50,625 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:50,626 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:50,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21374414] [2022-12-14 07:40:50,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21374414] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:50,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:50,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:40:50,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715496859] [2022-12-14 07:40:50,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:50,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:40:50,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:50,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:40:50,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:50,627 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:50,962 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-12-14 07:40:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:40:50,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 07:40:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:50,963 INFO L225 Difference]: With dead ends: 132 [2022-12-14 07:40:50,963 INFO L226 Difference]: Without dead ends: 132 [2022-12-14 07:40:50,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-12-14 07:40:50,964 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 10 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:50,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 270 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:40:50,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-12-14 07:40:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-12-14 07:40:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 93 states have (on average 1.5376344086021505) 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-12-14 07:40:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-12-14 07:40:50,970 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 11 [2022-12-14 07:40:50,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:50,970 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-12-14 07:40:50,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-12-14 07:40:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 07:40:50,971 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:50,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:50,978 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-14 07:40:51,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:51,173 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:51,174 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2022-12-14 07:40:51,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:51,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408660939] [2022-12-14 07:40:51,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:51,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:51,175 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:51,175 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:51,177 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-14 07:40:51,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:51,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-14 07:40:51,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:51,257 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:51,276 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:51,281 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:51,308 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:51,311 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:51,323 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:51,323 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:51,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408660939] [2022-12-14 07:40:51,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408660939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:51,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:51,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 07:40:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892640932] [2022-12-14 07:40:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:51,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:40:51,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:51,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:40:51,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:51,325 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:51,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:51,695 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-12-14 07:40:51,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-14 07:40:51,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 07:40:51,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:51,696 INFO L225 Difference]: With dead ends: 131 [2022-12-14 07:40:51,696 INFO L226 Difference]: Without dead ends: 131 [2022-12-14 07:40:51,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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-12-14 07:40:51,697 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 5 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:51,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 259 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:40:51,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-12-14 07:40:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-12-14 07:40:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 93 states have (on average 1.5161290322580645) 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-12-14 07:40:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2022-12-14 07:40:51,702 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 11 [2022-12-14 07:40:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:51,702 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2022-12-14 07:40:51,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:51,702 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-12-14 07:40:51,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 07:40:51,703 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:51,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:51,710 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-14 07:40:51,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:51,904 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash -200394276, now seen corresponding path program 1 times [2022-12-14 07:40:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:51,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593380123] [2022-12-14 07:40:51,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:51,907 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:51,908 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:51,910 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:51,913 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-14 07:40:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:52,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:40:52,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:52,019 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:52,048 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:52,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:52,055 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:52,055 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:52,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593380123] [2022-12-14 07:40:52,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [593380123] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:52,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:52,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:40:52,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145840574] [2022-12-14 07:40:52,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:52,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:40:52,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:52,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:40:52,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:52,057 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:52,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:52,422 INFO L93 Difference]: Finished difference Result 191 states and 206 transitions. [2022-12-14 07:40:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:40:52,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 07:40:52,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:52,423 INFO L225 Difference]: With dead ends: 191 [2022-12-14 07:40:52,423 INFO L226 Difference]: Without dead ends: 191 [2022-12-14 07:40:52,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 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-12-14 07:40:52,424 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 84 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:52,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 260 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:40:52,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-12-14 07:40:52,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 136. [2022-12-14 07:40:52,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 98 states have (on average 1.489795918367347) internal successors, (146), 135 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-12-14 07:40:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 146 transitions. [2022-12-14 07:40:52,429 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 146 transitions. Word has length 13 [2022-12-14 07:40:52,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:52,429 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 146 transitions. [2022-12-14 07:40:52,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 07:40:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 146 transitions. [2022-12-14 07:40:52,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 07:40:52,430 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:52,430 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:52,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-14 07:40:52,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:52,631 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:52,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:52,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2022-12-14 07:40:52,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:52,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182532785] [2022-12-14 07:40:52,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:52,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:52,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:52,633 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:52,634 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-14 07:40:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:52,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-14 07:40:52,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:52,743 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 07:40:52,743 INFO L350 Elim1Store]: Elim1 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 22 [2022-12-14 07:40:52,833 INFO L321 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2022-12-14 07:40:52,833 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2022-12-14 07:40:52,891 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:53,027 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:40:53,027 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 45 [2022-12-14 07:40:53,075 INFO L350 Elim1Store]: Elim1 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 43 treesize of output 27 [2022-12-14 07:40:53,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:53,180 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:53,180 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:53,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182532785] [2022-12-14 07:40:53,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182532785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:53,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:53,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:40:53,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065216398] [2022-12-14 07:40:53,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:53,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-14 07:40:53,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:53,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-14 07:40:53,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-14 07:40:53,181 INFO L87 Difference]: Start difference. First operand 136 states and 146 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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-12-14 07:40:54,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:54,314 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-12-14 07:40:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 07:40:54,315 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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-12-14 07:40:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:54,315 INFO L225 Difference]: With dead ends: 157 [2022-12-14 07:40:54,315 INFO L226 Difference]: Without dead ends: 157 [2022-12-14 07:40:54,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-12-14 07:40:54,316 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 305 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:54,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 241 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-14 07:40:54,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-12-14 07:40:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 135. [2022-12-14 07:40:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 98 states have (on average 1.4795918367346939) internal successors, (145), 134 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-12-14 07:40:54,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 145 transitions. [2022-12-14 07:40:54,318 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 145 transitions. Word has length 15 [2022-12-14 07:40:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:54,318 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 145 transitions. [2022-12-14 07:40:54,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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-12-14 07:40:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 145 transitions. [2022-12-14 07:40:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 07:40:54,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:54,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:54,330 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-12-14 07:40:54,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:54,521 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:54,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2022-12-14 07:40:54,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:54,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219502394] [2022-12-14 07:40:54,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:54,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:54,524 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:54,526 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:54,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-14 07:40:54,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:54,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 22 conjunts are in the unsatisfiable core [2022-12-14 07:40:54,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:54,619 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:54,639 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:54,648 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-12-14 07:40:54,648 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:54,671 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:54,679 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:54,752 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 07:40:54,752 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:54,762 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:54,787 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:54,793 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:54,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:54,831 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:54,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219502394] [2022-12-14 07:40:54,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219502394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:54,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:54,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 07:40:54,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424244456] [2022-12-14 07:40:54,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:54,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-14 07:40:54,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:54,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-14 07:40:54,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-14 07:40:54,832 INFO L87 Difference]: Start difference. First operand 135 states and 145 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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-12-14 07:40:55,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:55,901 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2022-12-14 07:40:55,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-14 07:40:55,902 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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-12-14 07:40:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:55,902 INFO L225 Difference]: With dead ends: 139 [2022-12-14 07:40:55,902 INFO L226 Difference]: Without dead ends: 139 [2022-12-14 07:40:55,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-12-14 07:40:55,903 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 159 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:55,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 221 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-12-14 07:40:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-14 07:40:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2022-12-14 07:40:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 99 states have (on average 1.4242424242424243) 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-12-14 07:40:55,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2022-12-14 07:40:55,906 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 15 [2022-12-14 07:40:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:55,906 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2022-12-14 07:40:55,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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-12-14 07:40:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2022-12-14 07:40:55,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 07:40:55,906 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:55,906 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-12-14 07:40:55,914 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-14 07:40:56,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:56,108 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:56,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash -715208061, now seen corresponding path program 1 times [2022-12-14 07:40:56,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:56,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338615988] [2022-12-14 07:40:56,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:56,110 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:56,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:56,113 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:56,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-14 07:40:56,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 07:40:56,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 07:40:56,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 07:40:56,239 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:56,270 INFO L350 Elim1Store]: Elim1 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-12-14 07:40:56,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 07:40:56,278 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 07:40:56,278 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-12-14 07:40:56,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338615988] [2022-12-14 07:40:56,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338615988] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 07:40:56,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 07:40:56,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 07:40:56,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890038227] [2022-12-14 07:40:56,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 07:40:56,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 07:40:56,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-12-14 07:40:56,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 07:40:56,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 07:40:56,280 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 5 states, 5 states have (on average 3.8) 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-12-14 07:40:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 07:40:56,625 INFO L93 Difference]: Finished difference Result 184 states and 199 transitions. [2022-12-14 07:40:56,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 07:40:56,626 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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-12-14 07:40:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 07:40:56,626 INFO L225 Difference]: With dead ends: 184 [2022-12-14 07:40:56,626 INFO L226 Difference]: Without dead ends: 184 [2022-12-14 07:40:56,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 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-12-14 07:40:56,627 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 75 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 07:40:56,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 238 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 07:40:56,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-12-14 07:40:56,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 134. [2022-12-14 07:40:56,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 103 states have (on average 1.4077669902912622) 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-12-14 07:40:56,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-12-14 07:40:56,629 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 19 [2022-12-14 07:40:56,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 07:40:56,629 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-12-14 07:40:56,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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-12-14 07:40:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-12-14 07:40:56,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 07:40:56,630 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 07:40:56,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:56,641 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-14 07:40:56,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:56,831 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2022-12-14 07:40:56,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 07:40:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash -714897179, now seen corresponding path program 1 times [2022-12-14 07:40:56,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-12-14 07:40:56,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649319957] [2022-12-14 07:40:56,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 07:40:56,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:56,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat [2022-12-14 07:40:56,835 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-14 07:40:56,836 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-14 07:40:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 07:40:56,904 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 07:40:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 07:40:56,945 INFO L130 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2022-12-14 07:40:56,946 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 07:40:56,946 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (64 of 65 remaining) [2022-12-14 07:40:56,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 65 remaining) [2022-12-14 07:40:56,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 65 remaining) [2022-12-14 07:40:56,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 65 remaining) [2022-12-14 07:40:56,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 65 remaining) [2022-12-14 07:40:56,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 65 remaining) [2022-12-14 07:40:56,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 65 remaining) [2022-12-14 07:40:56,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK (31 of 65 remaining) [2022-12-14 07:40:56,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 65 remaining) [2022-12-14 07:40:56,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 65 remaining) [2022-12-14 07:40:56,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_LEAK (28 of 65 remaining) [2022-12-14 07:40:56,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 65 remaining) [2022-12-14 07:40:56,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 65 remaining) [2022-12-14 07:40:56,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 65 remaining) [2022-12-14 07:40:56,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 65 remaining) [2022-12-14 07:40:56,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 65 remaining) [2022-12-14 07:40:56,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 65 remaining) [2022-12-14 07:40:56,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 65 remaining) [2022-12-14 07:40:56,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 65 remaining) [2022-12-14 07:40:56,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 65 remaining) [2022-12-14 07:40:56,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 65 remaining) [2022-12-14 07:40:56,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 65 remaining) [2022-12-14 07:40:56,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 65 remaining) [2022-12-14 07:40:56,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 65 remaining) [2022-12-14 07:40:56,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 65 remaining) [2022-12-14 07:40:56,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE (13 of 65 remaining) [2022-12-14 07:40:56,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE (12 of 65 remaining) [2022-12-14 07:40:56,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (11 of 65 remaining) [2022-12-14 07:40:56,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 65 remaining) [2022-12-14 07:40:56,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 65 remaining) [2022-12-14 07:40:56,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (8 of 65 remaining) [2022-12-14 07:40:56,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (7 of 65 remaining) [2022-12-14 07:40:56,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (6 of 65 remaining) [2022-12-14 07:40:56,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 65 remaining) [2022-12-14 07:40:56,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 65 remaining) [2022-12-14 07:40:56,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (3 of 65 remaining) [2022-12-14 07:40:56,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (2 of 65 remaining) [2022-12-14 07:40:56,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (1 of 65 remaining) [2022-12-14 07:40:56,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (0 of 65 remaining) [2022-12-14 07:40:56,962 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-14 07:40:57,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-14 07:40:57,160 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 07:40:57,166 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 07:40:57,201 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 07:40:57 BoogieIcfgContainer [2022-12-14 07:40:57,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 07:40:57,201 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 07:40:57,201 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 07:40:57,202 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 07:40:57,202 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 07:40:46" (3/4) ... [2022-12-14 07:40:57,205 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-14 07:40:57,205 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 07:40:57,205 INFO L158 Benchmark]: Toolchain (without parser) took 11454.10ms. Allocated memory is still 98.6MB. Free memory was 75.2MB in the beginning and 27.9MB in the end (delta: 47.3MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2022-12-14 07:40:57,206 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 65.0MB. Free memory was 43.7MB in the beginning and 43.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 07:40:57,206 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.62ms. Allocated memory is still 98.6MB. Free memory was 75.2MB in the beginning and 56.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 07:40:57,206 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.44ms. Allocated memory is still 98.6MB. Free memory was 56.3MB in the beginning and 53.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:40:57,206 INFO L158 Benchmark]: Boogie Preprocessor took 24.33ms. Allocated memory is still 98.6MB. Free memory was 53.9MB in the beginning and 51.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:40:57,206 INFO L158 Benchmark]: RCFGBuilder took 673.23ms. Allocated memory is still 98.6MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: -14.2kB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2022-12-14 07:40:57,207 INFO L158 Benchmark]: TraceAbstraction took 10344.92ms. Allocated memory is still 98.6MB. Free memory was 51.4MB in the beginning and 29.0MB in the end (delta: 22.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-12-14 07:40:57,207 INFO L158 Benchmark]: Witness Printer took 3.74ms. Allocated memory is still 98.6MB. Free memory was 29.0MB in the beginning and 27.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 07:40:57,208 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.16ms. Allocated memory is still 65.0MB. Free memory was 43.7MB in the beginning and 43.6MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.62ms. Allocated memory is still 98.6MB. Free memory was 75.2MB in the beginning and 56.3MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.44ms. Allocated memory is still 98.6MB. Free memory was 56.3MB in the beginning and 53.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.33ms. Allocated memory is still 98.6MB. Free memory was 53.9MB in the beginning and 51.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 673.23ms. Allocated memory is still 98.6MB. Free memory was 51.9MB in the beginning and 51.9MB in the end (delta: -14.2kB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10344.92ms. Allocated memory is still 98.6MB. Free memory was 51.4MB in the beginning and 29.0MB in the end (delta: 22.4MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Witness Printer took 3.74ms. Allocated memory is still 98.6MB. Free memory was 29.0MB in the beginning and 27.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 1051]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1051. Possible FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) VAL [list={6:0}] [L1007] list->prev = ((void*)0) VAL [list={6:0}] [L1008] list->colour = BLACK VAL [list={6:0}] [L1010] SLL* end = list; VAL [end={6:0}, list={6:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={6:0}, list={6:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={6:0}, list={6:0}] [L1041] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end VAL [end={6:0}, list={6:0}] [L1045] EXPR end->colour VAL [end={6:0}, end->colour=1, list={6:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={6:0}, end->next={0:0}, list={6:0}] [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={6:0}, list={6: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: 1040]: 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: 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: -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: 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. - UnprovableResult [Line: 1002]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 136 locations, 65 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1361 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1361 mSDsluCounter, 1946 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1141 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2204 IncrementalHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 805 mSDtfsCounter, 2204 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=136occurred in iteration=0, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 217 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 105 ConstructedInterpolants, 2 QuantifiedInterpolants, 992 SizeOfPredicates, 41 NumberOfNonLiveVariables, 843 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-14 07:40:57,221 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e89674fe-b9ff-47a1-ad64-85b881dd8cb9/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample