./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/sll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:19:16,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:19:16,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:19:16,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:19:16,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:19:16,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:19:16,433 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:19:16,435 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:19:16,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:19:16,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:19:16,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:19:16,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:19:16,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:19:16,454 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:19:16,455 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:19:16,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:19:16,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:19:16,459 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:19:16,461 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:19:16,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:19:16,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:19:16,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:19:16,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:19:16,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:19:16,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:19:16,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:19:16,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:19:16,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:19:16,492 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:19:16,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:19:16,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:19:16,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:19:16,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:19:16,506 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:19:16,507 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:19:16,508 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:19:16,508 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:19:16,509 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:19:16,509 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:19:16,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:19:16,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:19:16,512 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:19:16,564 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:19:16,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:19:16,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:19:16,566 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:19:16,567 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:19:16,567 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:19:16,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:19:16,568 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:19:16,568 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:19:16,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:19:16,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:19:16,570 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:19:16,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:19:16,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:19:16,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:19:16,571 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:19:16,572 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:19:16,572 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:19:16,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:19:16,572 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:19:16,573 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:19:16,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:19:16,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:19:16,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:19:16,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:19:16,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:19:16,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:19:16,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:19:16,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:19:16,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:19:16,577 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_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/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_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc 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 -> Automizer 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 -> 618946a6e113450d0f3efa55a455801e1c2225c3ba6f88e87a9e8ad02019b85f [2022-11-02 20:19:16,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:19:16,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:19:16,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:19:16,968 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:19:16,969 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:19:16,970 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/sll-sorted-2.i [2022-11-02 20:19:17,046 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/data/c969ebf3c/28965aeaf7c642c491e02f7eaab7f9c3/FLAGfdae6bc5e [2022-11-02 20:19:17,809 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:19:17,810 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i [2022-11-02 20:19:17,835 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/data/c969ebf3c/28965aeaf7c642c491e02f7eaab7f9c3/FLAGfdae6bc5e [2022-11-02 20:19:18,081 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/data/c969ebf3c/28965aeaf7c642c491e02f7eaab7f9c3 [2022-11-02 20:19:18,092 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:19:18,094 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:19:18,096 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:19:18,096 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:19:18,100 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:19:18,101 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40417535 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18, skipping insertion in model container [2022-11-02 20:19:18,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:19:18,172 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:19:18,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22317,22330] [2022-11-02 20:19:18,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22452,22465] [2022-11-02 20:19:18,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22612,22625] [2022-11-02 20:19:18,529 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22941,22954] [2022-11-02 20:19:18,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23005,23018] [2022-11-02 20:19:18,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23136,23149] [2022-11-02 20:19:18,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23200,23213] [2022-11-02 20:19:18,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:19:18,546 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:19:18,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22317,22330] [2022-11-02 20:19:18,587 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22452,22465] [2022-11-02 20:19:18,589 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22612,22625] [2022-11-02 20:19:18,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[22941,22954] [2022-11-02 20:19:18,593 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23005,23018] [2022-11-02 20:19:18,595 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23136,23149] [2022-11-02 20:19:18,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/sv-benchmarks/c/forester-heap/sll-sorted-2.i[23200,23213] [2022-11-02 20:19:18,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:19:18,626 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:19:18,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18 WrapperNode [2022-11-02 20:19:18,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:19:18,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:19:18,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:19:18,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:19:18,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,682 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,730 INFO L138 Inliner]: procedures = 119, calls = 40, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 199 [2022-11-02 20:19:18,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:19:18,732 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:19:18,732 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:19:18,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:19:18,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,775 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,783 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:19:18,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:19:18,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:19:18,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:19:18,791 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (1/1) ... [2022-11-02 20:19:18,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:19:18,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:18,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:19:18,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:19:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:19:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:19:18,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:19:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:19:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:19:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:19:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:19:18,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:19:18,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:19:18,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:19:19,121 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:19:19,131 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:19:19,815 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:19:19,826 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:19:19,826 INFO L300 CfgBuilder]: Removed 20 assume(true) statements. [2022-11-02 20:19:19,829 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:19:19 BoogieIcfgContainer [2022-11-02 20:19:19,831 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:19:19,835 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:19:19,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:19:19,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:19:19,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:19:18" (1/3) ... [2022-11-02 20:19:19,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edce096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:19:19, skipping insertion in model container [2022-11-02 20:19:19,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:19:18" (2/3) ... [2022-11-02 20:19:19,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1edce096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:19:19, skipping insertion in model container [2022-11-02 20:19:19,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:19:19" (3/3) ... [2022-11-02 20:19:19,849 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-sorted-2.i [2022-11-02 20:19:19,875 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:19:19,875 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2022-11-02 20:19:19,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:19:19,976 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;@423acb5d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:19:19,976 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2022-11-02 20:19:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 94 states have (on average 2.1702127659574466) internal successors, (204), 165 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:20,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:19:20,010 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:20,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:19:20,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:20,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:20,024 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 20:19:20,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:20,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245743367] [2022-11-02 20:19:20,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:20,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:20,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:20,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245743367] [2022-11-02 20:19:20,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245743367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:20,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:20,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878574051] [2022-11-02 20:19:20,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:20,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:20,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:20,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:20,426 INFO L87 Difference]: Start difference. First operand has 166 states, 94 states have (on average 2.1702127659574466) internal successors, (204), 165 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:20,688 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2022-11-02 20:19:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:20,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:19:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:20,704 INFO L225 Difference]: With dead ends: 170 [2022-11-02 20:19:20,704 INFO L226 Difference]: Without dead ends: 166 [2022-11-02 20:19:20,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:20,726 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:20,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 116 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:19:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-02 20:19:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2022-11-02 20:19:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 93 states have (on average 1.8602150537634408) internal successors, (173), 161 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2022-11-02 20:19:20,778 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 3 [2022-11-02 20:19:20,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:20,778 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2022-11-02 20:19:20,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2022-11-02 20:19:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:19:20,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:20,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:19:20,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:19:20,780 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:20,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:20,781 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 20:19:20,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:20,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45152909] [2022-11-02 20:19:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:20,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:20,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:20,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45152909] [2022-11-02 20:19:20,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45152909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:20,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:20,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:20,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924943996] [2022-11-02 20:19:20,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:20,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:20,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:20,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:20,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:20,889 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:21,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:21,117 INFO L93 Difference]: Finished difference Result 164 states and 175 transitions. [2022-11-02 20:19:21,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:21,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:19:21,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:21,120 INFO L225 Difference]: With dead ends: 164 [2022-11-02 20:19:21,120 INFO L226 Difference]: Without dead ends: 164 [2022-11-02 20:19:21,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:21,123 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 156 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:21,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 114 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:19:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-11-02 20:19:21,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2022-11-02 20:19:21,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 93 states have (on average 1.8387096774193548) internal successors, (171), 159 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2022-11-02 20:19:21,141 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 3 [2022-11-02 20:19:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:21,142 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2022-11-02 20:19:21,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2022-11-02 20:19:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:19:21,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:21,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:21,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:19:21,144 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:21,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-11-02 20:19:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:21,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956574484] [2022-11-02 20:19:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:21,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:21,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956574484] [2022-11-02 20:19:21,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956574484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:21,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:21,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:19:21,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267176139] [2022-11-02 20:19:21,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:21,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:19:21,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:21,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:19:21,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:19:21,504 INFO L87 Difference]: Start difference. First operand 160 states and 171 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-11-02 20:19:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:21,824 INFO L93 Difference]: Finished difference Result 168 states and 182 transitions. [2022-11-02 20:19:21,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:19:21,825 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-11-02 20:19:21,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:21,828 INFO L225 Difference]: With dead ends: 168 [2022-11-02 20:19:21,829 INFO L226 Difference]: Without dead ends: 168 [2022-11-02 20:19:21,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:19:21,830 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 276 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:21,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 88 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-02 20:19:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2022-11-02 20:19:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 107 states have (on average 1.6728971962616823) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2022-11-02 20:19:21,854 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 8 [2022-11-02 20:19:21,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:21,855 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2022-11-02 20:19:21,856 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-11-02 20:19:21,856 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-11-02 20:19:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:19:21,857 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:21,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:21,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:19:21,858 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:21,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:21,859 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-11-02 20:19:21,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:21,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937189328] [2022-11-02 20:19:21,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:21,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:21,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:22,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937189328] [2022-11-02 20:19:22,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937189328] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:22,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:22,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:19:22,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363009777] [2022-11-02 20:19:22,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:22,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:19:22,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:22,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:19:22,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:19:22,065 INFO L87 Difference]: Start difference. First operand 157 states and 179 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-11-02 20:19:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:22,423 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2022-11-02 20:19:22,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:19:22,424 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-11-02 20:19:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:22,429 INFO L225 Difference]: With dead ends: 240 [2022-11-02 20:19:22,429 INFO L226 Difference]: Without dead ends: 240 [2022-11-02 20:19:22,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:19:22,440 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 315 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:22,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 146 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-11-02 20:19:22,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 206. [2022-11-02 20:19:22,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 156 states have (on average 1.5705128205128205) internal successors, (245), 205 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:22,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 245 transitions. [2022-11-02 20:19:22,475 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 245 transitions. Word has length 8 [2022-11-02 20:19:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:22,480 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 245 transitions. [2022-11-02 20:19:22,480 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-11-02 20:19:22,480 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 245 transitions. [2022-11-02 20:19:22,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:19:22,481 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:22,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:22,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:19:22,482 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:22,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:22,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1117776432, now seen corresponding path program 1 times [2022-11-02 20:19:22,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:22,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655345798] [2022-11-02 20:19:22,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:22,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:22,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:22,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:22,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:22,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655345798] [2022-11-02 20:19:22,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655345798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:22,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:22,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:19:22,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597814419] [2022-11-02 20:19:22,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:22,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:22,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:22,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:22,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:22,583 INFO L87 Difference]: Start difference. First operand 206 states and 245 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:22,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:22,624 INFO L93 Difference]: Finished difference Result 246 states and 288 transitions. [2022-11-02 20:19:22,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:22,625 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:19:22,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:22,628 INFO L225 Difference]: With dead ends: 246 [2022-11-02 20:19:22,628 INFO L226 Difference]: Without dead ends: 246 [2022-11-02 20:19:22,628 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:22,629 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 111 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:22,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 217 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:19:22,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-02 20:19:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2022-11-02 20:19:22,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 166 states have (on average 1.5602409638554218) internal successors, (259), 215 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:22,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 259 transitions. [2022-11-02 20:19:22,660 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 259 transitions. Word has length 10 [2022-11-02 20:19:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:22,660 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 259 transitions. [2022-11-02 20:19:22,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 259 transitions. [2022-11-02 20:19:22,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:19:22,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:22,661 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:22,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:19:22,662 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:22,663 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-11-02 20:19:22,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:22,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502218950] [2022-11-02 20:19:22,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:22,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:22,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:22,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:22,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:22,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502218950] [2022-11-02 20:19:22,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502218950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:22,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:22,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:19:22,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032666436] [2022-11-02 20:19:22,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:22,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:22,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:22,906 INFO L87 Difference]: Start difference. First operand 216 states and 259 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:23,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:23,267 INFO L93 Difference]: Finished difference Result 222 states and 264 transitions. [2022-11-02 20:19:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:19:23,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:19:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:23,269 INFO L225 Difference]: With dead ends: 222 [2022-11-02 20:19:23,269 INFO L226 Difference]: Without dead ends: 222 [2022-11-02 20:19:23,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:19:23,271 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 106 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:23,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 372 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-11-02 20:19:23,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 215. [2022-11-02 20:19:23,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 166 states have (on average 1.5481927710843373) internal successors, (257), 214 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:23,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 257 transitions. [2022-11-02 20:19:23,281 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 257 transitions. Word has length 12 [2022-11-02 20:19:23,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:23,282 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 257 transitions. [2022-11-02 20:19:23,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:23,291 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 257 transitions. [2022-11-02 20:19:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:19:23,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:23,291 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:23,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:19:23,292 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:23,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-11-02 20:19:23,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:23,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062685646] [2022-11-02 20:19:23,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:23,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:23,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:23,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:23,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062685646] [2022-11-02 20:19:23,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062685646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:23,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:23,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:19:23,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686837571] [2022-11-02 20:19:23,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:23,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:23,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:23,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:23,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:23,752 INFO L87 Difference]: Start difference. First operand 215 states and 257 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:24,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:24,165 INFO L93 Difference]: Finished difference Result 211 states and 250 transitions. [2022-11-02 20:19:24,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:19:24,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:19:24,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:24,167 INFO L225 Difference]: With dead ends: 211 [2022-11-02 20:19:24,168 INFO L226 Difference]: Without dead ends: 211 [2022-11-02 20:19:24,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:19:24,169 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 15 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:24,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 456 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:24,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-11-02 20:19:24,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2022-11-02 20:19:24,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 161 states have (on average 1.515527950310559) internal successors, (244), 204 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 244 transitions. [2022-11-02 20:19:24,177 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 244 transitions. Word has length 12 [2022-11-02 20:19:24,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:24,177 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 244 transitions. [2022-11-02 20:19:24,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:24,178 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 244 transitions. [2022-11-02 20:19:24,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-02 20:19:24,179 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:24,179 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:24,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:19:24,182 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:24,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1270421215, now seen corresponding path program 1 times [2022-11-02 20:19:24,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:24,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218390263] [2022-11-02 20:19:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:24,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:24,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:19:24,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:24,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218390263] [2022-11-02 20:19:24,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218390263] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:24,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:24,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:19:24,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400822075] [2022-11-02 20:19:24,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:24,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:19:24,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:24,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:19:24,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:19:24,319 INFO L87 Difference]: Start difference. First operand 205 states and 244 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:24,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:24,496 INFO L93 Difference]: Finished difference Result 237 states and 260 transitions. [2022-11-02 20:19:24,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:19:24,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-02 20:19:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:24,498 INFO L225 Difference]: With dead ends: 237 [2022-11-02 20:19:24,498 INFO L226 Difference]: Without dead ends: 237 [2022-11-02 20:19:24,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:19:24,499 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 283 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:24,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 196 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:19:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-11-02 20:19:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 203. [2022-11-02 20:19:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 160 states have (on average 1.5) internal successors, (240), 202 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 240 transitions. [2022-11-02 20:19:24,507 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 240 transitions. Word has length 21 [2022-11-02 20:19:24,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:24,507 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 240 transitions. [2022-11-02 20:19:24,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:24,508 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 240 transitions. [2022-11-02 20:19:24,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:19:24,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:24,509 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:24,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:19:24,510 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:24,510 INFO L85 PathProgramCache]: Analyzing trace with hash -697189136, now seen corresponding path program 1 times [2022-11-02 20:19:24,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:24,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088980165] [2022-11-02 20:19:24,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:24,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:24,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:25,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:25,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:25,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088980165] [2022-11-02 20:19:25,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088980165] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:25,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660816364] [2022-11-02 20:19:25,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:25,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:25,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:25,194 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:25,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:19:25,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:25,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 20:19:25,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:25,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:19:25,639 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:19:25,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:19:25,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:19:25,984 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:19:25,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:19:26,088 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:19:26,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:19:26,345 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:26,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:19:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:26,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:26,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:26,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-02 20:19:26,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:26,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-11-02 20:19:26,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-11-02 20:19:31,665 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:31,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660816364] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:31,666 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:19:31,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 29 [2022-11-02 20:19:31,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936967383] [2022-11-02 20:19:31,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:31,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 20:19:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:31,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 20:19:31,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=740, Unknown=7, NotChecked=0, Total=870 [2022-11-02 20:19:31,669 INFO L87 Difference]: Start difference. First operand 203 states and 240 transitions. Second operand has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:33,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:33,838 INFO L93 Difference]: Finished difference Result 660 states and 757 transitions. [2022-11-02 20:19:33,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:19:33,839 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:19:33,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:33,845 INFO L225 Difference]: With dead ends: 660 [2022-11-02 20:19:33,848 INFO L226 Difference]: Without dead ends: 660 [2022-11-02 20:19:33,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=359, Invalid=1704, Unknown=7, NotChecked=0, Total=2070 [2022-11-02 20:19:33,850 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1340 mSDsluCounter, 1313 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1340 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 2302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:33,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1340 Valid, 1400 Invalid, 2302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 1055 Invalid, 0 Unknown, 1153 Unchecked, 1.2s Time] [2022-11-02 20:19:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-11-02 20:19:33,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 225. [2022-11-02 20:19:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.467032967032967) internal successors, (267), 224 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 267 transitions. [2022-11-02 20:19:33,866 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 267 transitions. Word has length 27 [2022-11-02 20:19:33,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:33,866 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 267 transitions. [2022-11-02 20:19:33,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.586206896551724) internal successors, (75), 30 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:33,867 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 267 transitions. [2022-11-02 20:19:33,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 20:19:33,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:33,868 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:33,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:34,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:34,091 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:34,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:34,092 INFO L85 PathProgramCache]: Analyzing trace with hash -697189135, now seen corresponding path program 1 times [2022-11-02 20:19:34,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:34,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310609111] [2022-11-02 20:19:34,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:34,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:34,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:34,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:34,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310609111] [2022-11-02 20:19:34,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310609111] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:34,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803873860] [2022-11-02 20:19:34,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:34,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:34,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:34,918 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:34,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:19:35,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:35,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-02 20:19:35,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:35,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:19:35,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:19:35,210 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:19:35,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:19:35,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:19:35,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:19:35,514 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:19:35,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:19:35,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-02 20:19:35,549 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:19:35,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:19:35,678 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:19:35,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:19:35,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:19:35,953 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:35,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:19:35,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:35,969 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:35,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-02 20:19:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:36,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:36,427 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 4)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|))))) is different from false [2022-11-02 20:19:36,618 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 4)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|))))) is different from false [2022-11-02 20:19:36,659 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_280) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_279 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_279) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) 4)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|)))))) is different from false [2022-11-02 20:19:36,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:36,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-11-02 20:19:36,749 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:36,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 20:19:36,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:36,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 55 [2022-11-02 20:19:36,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:36,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 81 [2022-11-02 20:19:36,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 34 treesize of output 30 [2022-11-02 20:19:36,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 62 treesize of output 58 [2022-11-02 20:19:36,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:36,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-02 20:19:36,923 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:36,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:36,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:36,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-02 20:19:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:37,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803873860] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:37,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:19:37,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-11-02 20:19:37,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909370735] [2022-11-02 20:19:37,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:37,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-02 20:19:37,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:37,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-02 20:19:37,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=722, Unknown=3, NotChecked=168, Total=992 [2022-11-02 20:19:37,311 INFO L87 Difference]: Start difference. First operand 225 states and 267 transitions. Second operand has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:40,373 INFO L93 Difference]: Finished difference Result 472 states and 532 transitions. [2022-11-02 20:19:40,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:19:40,374 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 20:19:40,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:40,376 INFO L225 Difference]: With dead ends: 472 [2022-11-02 20:19:40,376 INFO L226 Difference]: Without dead ends: 472 [2022-11-02 20:19:40,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 42 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=469, Invalid=2296, Unknown=3, NotChecked=312, Total=3080 [2022-11-02 20:19:40,379 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 1350 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 1201 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1492 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:40,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1350 Valid, 1197 Invalid, 2789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 1201 Invalid, 0 Unknown, 1492 Unchecked, 1.3s Time] [2022-11-02 20:19:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-11-02 20:19:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 225. [2022-11-02 20:19:40,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 182 states have (on average 1.4615384615384615) internal successors, (266), 224 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2022-11-02 20:19:40,388 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 27 [2022-11-02 20:19:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:40,388 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2022-11-02 20:19:40,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5483870967741935) internal successors, (79), 32 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,389 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2022-11-02 20:19:40,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:19:40,390 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:40,390 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:40,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:40,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:40,615 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:40,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:40,615 INFO L85 PathProgramCache]: Analyzing trace with hash 24884122, now seen corresponding path program 1 times [2022-11-02 20:19:40,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:40,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559430493] [2022-11-02 20:19:40,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:40,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:40,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:19:40,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:40,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559430493] [2022-11-02 20:19:40,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559430493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:40,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:40,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:19:40,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884662080] [2022-11-02 20:19:40,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:40,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:40,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:40,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:40,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:40,664 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:40,674 INFO L93 Difference]: Finished difference Result 227 states and 268 transitions. [2022-11-02 20:19:40,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:40,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:19:40,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:40,677 INFO L225 Difference]: With dead ends: 227 [2022-11-02 20:19:40,677 INFO L226 Difference]: Without dead ends: 227 [2022-11-02 20:19:40,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:40,678 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:40,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:19:40,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-11-02 20:19:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2022-11-02 20:19:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 184 states have (on average 1.4565217391304348) internal successors, (268), 226 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 268 transitions. [2022-11-02 20:19:40,685 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 268 transitions. Word has length 29 [2022-11-02 20:19:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:40,685 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 268 transitions. [2022-11-02 20:19:40,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 268 transitions. [2022-11-02 20:19:40,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:19:40,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:40,687 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:40,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:19:40,688 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:40,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:40,688 INFO L85 PathProgramCache]: Analyzing trace with hash -197370768, now seen corresponding path program 1 times [2022-11-02 20:19:40,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:40,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686284406] [2022-11-02 20:19:40,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:40,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:40,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:41,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:41,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686284406] [2022-11-02 20:19:41,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686284406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:41,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78797110] [2022-11-02 20:19:41,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:41,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:41,723 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:41,725 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:41,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:19:41,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:41,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 20:19:41,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:41,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:19:41,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:19:42,008 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:19:42,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:19:42,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:19:42,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:42,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:19:42,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:19:42,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:19:42,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:19:42,484 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:42,486 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:42,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-11-02 20:19:42,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:42,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:42,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0))) is different from false [2022-11-02 20:19:42,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-11-02 20:19:42,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-11-02 20:19:42,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_389)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-11-02 20:19:42,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_77| Int)) (or (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_77| v_ArrVal_389)) |v_ULTIMATE.start_main_#t~malloc3#1.base_12| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_77| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-11-02 20:19:42,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:42,970 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:42,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2022-11-02 20:19:42,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:42,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 32 [2022-11-02 20:19:42,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-02 20:19:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:43,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [78797110] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:43,099 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:19:43,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2022-11-02 20:19:43,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507094600] [2022-11-02 20:19:43,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:43,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 20:19:43,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:43,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 20:19:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=769, Unknown=6, NotChecked=300, Total=1190 [2022-11-02 20:19:43,103 INFO L87 Difference]: Start difference. First operand 227 states and 268 transitions. Second operand has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:43,878 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~marked~0#1| 0) (and (not .cse0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~marked~0#1| 1))) (<= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select .cse1 4) 0) (<= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (forall ((v_ArrVal_389 Int) (v_ArrVal_391 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_389)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_391) |c_ULTIMATE.start_main_~head~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_75|)) 0) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (<= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= |c_ULTIMATE.start_main_#t~malloc3#1.offset| 0))) is different from false [2022-11-02 20:19:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:46,994 INFO L93 Difference]: Finished difference Result 377 states and 438 transitions. [2022-11-02 20:19:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:19:46,995 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 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 32 [2022-11-02 20:19:46,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:46,996 INFO L225 Difference]: With dead ends: 377 [2022-11-02 20:19:46,997 INFO L226 Difference]: Without dead ends: 377 [2022-11-02 20:19:46,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=474, Invalid=2089, Unknown=11, NotChecked=618, Total=3192 [2022-11-02 20:19:46,999 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 493 mSDsluCounter, 2858 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 3033 SdHoareTripleChecker+Invalid, 2757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1155 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:46,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 3033 Invalid, 2757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1540 Invalid, 0 Unknown, 1155 Unchecked, 1.5s Time] [2022-11-02 20:19:47,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-11-02 20:19:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 228. [2022-11-02 20:19:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 185 states have (on average 1.454054054054054) internal successors, (269), 227 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 269 transitions. [2022-11-02 20:19:47,006 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 269 transitions. Word has length 32 [2022-11-02 20:19:47,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:47,006 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 269 transitions. [2022-11-02 20:19:47,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.6) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 269 transitions. [2022-11-02 20:19:47,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:19:47,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:47,011 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:47,055 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:47,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:19:47,231 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:47,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1640100151, now seen corresponding path program 1 times [2022-11-02 20:19:47,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:47,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585144718] [2022-11-02 20:19:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:47,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:19:47,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:47,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585144718] [2022-11-02 20:19:47,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585144718] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:47,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:47,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:19:47,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793614292] [2022-11-02 20:19:47,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:47,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:19:47,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:47,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:19:47,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:19:47,435 INFO L87 Difference]: Start difference. First operand 228 states and 269 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:47,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:47,777 INFO L93 Difference]: Finished difference Result 246 states and 289 transitions. [2022-11-02 20:19:47,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:19:47,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 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 32 [2022-11-02 20:19:47,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:47,781 INFO L225 Difference]: With dead ends: 246 [2022-11-02 20:19:47,782 INFO L226 Difference]: Without dead ends: 246 [2022-11-02 20:19:47,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:19:47,785 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 34 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:47,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 595 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:47,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-02 20:19:47,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 237. [2022-11-02 20:19:47,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 194 states have (on average 1.4381443298969072) internal successors, (279), 236 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:47,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 279 transitions. [2022-11-02 20:19:47,792 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 279 transitions. Word has length 32 [2022-11-02 20:19:47,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:47,792 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 279 transitions. [2022-11-02 20:19:47,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 279 transitions. [2022-11-02 20:19:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:19:47,799 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:47,799 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:47,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:19:47,800 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:47,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1640159733, now seen corresponding path program 1 times [2022-11-02 20:19:47,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:47,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391825139] [2022-11-02 20:19:47,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:47,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:47,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:19:47,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:47,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391825139] [2022-11-02 20:19:47,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391825139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:47,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:47,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:47,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963500900] [2022-11-02 20:19:47,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:47,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:47,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:47,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:47,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:47,924 INFO L87 Difference]: Start difference. First operand 237 states and 279 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:48,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:48,024 INFO L93 Difference]: Finished difference Result 234 states and 273 transitions. [2022-11-02 20:19:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 32 [2022-11-02 20:19:48,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:48,026 INFO L225 Difference]: With dead ends: 234 [2022-11-02 20:19:48,026 INFO L226 Difference]: Without dead ends: 234 [2022-11-02 20:19:48,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:48,027 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 78 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:48,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 151 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:19:48,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2022-11-02 20:19:48,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2022-11-02 20:19:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 194 states have (on average 1.407216494845361) internal successors, (273), 233 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2022-11-02 20:19:48,034 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 32 [2022-11-02 20:19:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:48,034 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2022-11-02 20:19:48,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2022-11-02 20:19:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:19:48,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:48,036 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:48,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:19:48,037 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:48,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:48,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1640159732, now seen corresponding path program 1 times [2022-11-02 20:19:48,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:48,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133933037] [2022-11-02 20:19:48,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:19:48,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133933037] [2022-11-02 20:19:48,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133933037] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:48,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:48,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:19:48,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792464548] [2022-11-02 20:19:48,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:48,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:19:48,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:48,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:19:48,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:48,115 INFO L87 Difference]: Start difference. First operand 234 states and 273 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:48,192 INFO L93 Difference]: Finished difference Result 232 states and 267 transitions. [2022-11-02 20:19:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:19:48,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 32 [2022-11-02 20:19:48,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:48,194 INFO L225 Difference]: With dead ends: 232 [2022-11-02 20:19:48,194 INFO L226 Difference]: Without dead ends: 232 [2022-11-02 20:19:48,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:19:48,198 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 67 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:48,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 173 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:19:48,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-02 20:19:48,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2022-11-02 20:19:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 194 states have (on average 1.3762886597938144) internal successors, (267), 230 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:48,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2022-11-02 20:19:48,206 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 32 [2022-11-02 20:19:48,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:48,207 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2022-11-02 20:19:48,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2022-11-02 20:19:48,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:19:48,208 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:48,208 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:48,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:19:48,209 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:48,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:48,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1267662762, now seen corresponding path program 1 times [2022-11-02 20:19:48,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:48,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340210767] [2022-11-02 20:19:48,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:48,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:48,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:19:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:48,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340210767] [2022-11-02 20:19:48,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340210767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:48,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:19:48,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:19:48,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466520762] [2022-11-02 20:19:48,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:48,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:48,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:48,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:48,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:19:48,320 INFO L87 Difference]: Start difference. First operand 231 states and 267 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:48,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:48,634 INFO L93 Difference]: Finished difference Result 254 states and 291 transitions. [2022-11-02 20:19:48,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:19:48,634 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 36 [2022-11-02 20:19:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:48,636 INFO L225 Difference]: With dead ends: 254 [2022-11-02 20:19:48,636 INFO L226 Difference]: Without dead ends: 254 [2022-11-02 20:19:48,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:19:48,637 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 113 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:48,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 334 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:48,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-02 20:19:48,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 238. [2022-11-02 20:19:48,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 201 states have (on average 1.3880597014925373) internal successors, (279), 237 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:48,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 279 transitions. [2022-11-02 20:19:48,644 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 279 transitions. Word has length 36 [2022-11-02 20:19:48,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:48,645 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 279 transitions. [2022-11-02 20:19:48,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:48,645 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 279 transitions. [2022-11-02 20:19:48,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:19:48,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:48,646 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:48,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:19:48,648 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:48,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1267662761, now seen corresponding path program 1 times [2022-11-02 20:19:48,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:48,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552977949] [2022-11-02 20:19:48,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:48,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:49,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:49,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552977949] [2022-11-02 20:19:49,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552977949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:49,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452982215] [2022-11-02 20:19:49,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:49,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:49,394 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:49,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:19:49,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:49,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-02 20:19:49,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:49,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-02 20:19:49,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:19:49,714 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:19:49,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:19:49,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452982215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:19:49,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:19:49,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 18 [2022-11-02 20:19:49,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144911041] [2022-11-02 20:19:49,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:19:49,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:19:49,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:49,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:19:49,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:19:49,718 INFO L87 Difference]: Start difference. First operand 238 states and 279 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:50,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:50,114 INFO L93 Difference]: Finished difference Result 250 states and 286 transitions. [2022-11-02 20:19:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:19:50,114 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 36 [2022-11-02 20:19:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:50,116 INFO L225 Difference]: With dead ends: 250 [2022-11-02 20:19:50,116 INFO L226 Difference]: Without dead ends: 250 [2022-11-02 20:19:50,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2022-11-02 20:19:50,117 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:50,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 407 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:19:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2022-11-02 20:19:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 236. [2022-11-02 20:19:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 201 states have (on average 1.36318407960199) internal successors, (274), 235 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 274 transitions. [2022-11-02 20:19:50,123 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 274 transitions. Word has length 36 [2022-11-02 20:19:50,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:50,124 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 274 transitions. [2022-11-02 20:19:50,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:50,124 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 274 transitions. [2022-11-02 20:19:50,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:19:50,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:50,135 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:50,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:50,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:19:50,362 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:50,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:50,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1546801846, now seen corresponding path program 1 times [2022-11-02 20:19:50,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:50,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808293385] [2022-11-02 20:19:50,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:50,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:50,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:51,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808293385] [2022-11-02 20:19:51,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808293385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:51,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511715781] [2022-11-02 20:19:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:51,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:51,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:51,478 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:51,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:19:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:51,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-02 20:19:51,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:51,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:19:51,692 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:19:51,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:19:51,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:19:51,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:19:51,867 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:19:51,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-02 20:19:51,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:51,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:19:51,996 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:19:51,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 47 [2022-11-02 20:19:52,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-02 20:19:52,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:19:52,559 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:52,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2022-11-02 20:19:52,571 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:52,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:19:52,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:19:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:52,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:52,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 49 [2022-11-02 20:19:53,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:53,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-11-02 20:19:53,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:53,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-11-02 20:19:53,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-11-02 20:19:53,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:53,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:19:53,796 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:53,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:53,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:19:53,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:19:53,832 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:19:53,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 1 [2022-11-02 20:19:54,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:54,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511715781] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:54,148 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:19:54,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 33 [2022-11-02 20:19:54,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765567259] [2022-11-02 20:19:54,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:54,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:19:54,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:54,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:19:54,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=948, Unknown=2, NotChecked=0, Total=1056 [2022-11-02 20:19:54,151 INFO L87 Difference]: Start difference. First operand 236 states and 274 transitions. Second operand has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:19:55,500 INFO L93 Difference]: Finished difference Result 278 states and 317 transitions. [2022-11-02 20:19:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:19:55,500 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-02 20:19:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:19:55,504 INFO L225 Difference]: With dead ends: 278 [2022-11-02 20:19:55,504 INFO L226 Difference]: Without dead ends: 278 [2022-11-02 20:19:55,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=206, Invalid=1514, Unknown=2, NotChecked=0, Total=1722 [2022-11-02 20:19:55,507 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 160 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1737 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 629 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:19:55,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1737 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 838 Invalid, 0 Unknown, 629 Unchecked, 0.8s Time] [2022-11-02 20:19:55,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-11-02 20:19:55,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 244. [2022-11-02 20:19:55,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 209 states have (on average 1.3588516746411483) internal successors, (284), 243 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:55,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 284 transitions. [2022-11-02 20:19:55,514 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 284 transitions. Word has length 38 [2022-11-02 20:19:55,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:19:55,515 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 284 transitions. [2022-11-02 20:19:55,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.0) internal successors, (99), 33 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:19:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 284 transitions. [2022-11-02 20:19:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:19:55,516 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:19:55,516 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:19:55,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:19:55,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:19:55,735 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:19:55,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:19:55,735 INFO L85 PathProgramCache]: Analyzing trace with hash -247701985, now seen corresponding path program 2 times [2022-11-02 20:19:55,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:19:55,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398949812] [2022-11-02 20:19:55,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:19:55,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:19:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:19:56,506 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:19:56,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398949812] [2022-11-02 20:19:56,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398949812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:19:56,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485318401] [2022-11-02 20:19:56,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:19:56,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:19:56,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:19:56,509 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:19:56,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:19:56,695 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:19:56,695 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:19:56,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-02 20:19:56,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:19:56,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:19:56,810 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:19:56,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:19:56,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:19:57,049 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:19:57,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-02 20:19:57,109 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:19:57,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-02 20:19:57,146 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:19:57,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:19:57,210 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:19:57,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-11-02 20:19:57,427 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:19:57,427 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2022-11-02 20:19:57,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 8 [2022-11-02 20:19:57,613 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:19:57,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-11-02 20:19:57,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 12 [2022-11-02 20:19:57,868 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:19:57,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:57,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-02 20:19:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:19:57,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:19:58,329 INFO L356 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2022-11-02 20:19:58,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-11-02 20:19:58,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_ArrVal_797 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_797) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-02 20:19:58,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:58,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-11-02 20:19:58,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_797) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-11-02 20:19:58,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_9 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_9) .cse0 v_ArrVal_797) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|))))) is different from false [2022-11-02 20:19:58,634 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_88| Int) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_797 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_9 |v_ULTIMATE.start_main_~x~0#1.offset_88|))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_9) .cse1 v_ArrVal_797) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|))) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2022-11-02 20:19:58,678 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:58,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:19:58,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:58,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 133 [2022-11-02 20:19:58,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 118 treesize of output 110 [2022-11-02 20:19:58,723 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:19:58,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 108 [2022-11-02 20:19:58,742 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:19:58,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-02 20:19:59,219 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-02 20:19:59,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485318401] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:19:59,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:19:59,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 43 [2022-11-02 20:19:59,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444056033] [2022-11-02 20:19:59,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:19:59,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-11-02 20:19:59,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:19:59,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-11-02 20:19:59,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1414, Unknown=9, NotChecked=316, Total=1892 [2022-11-02 20:19:59,224 INFO L87 Difference]: Start difference. First operand 244 states and 284 transitions. Second operand has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:02,085 INFO L93 Difference]: Finished difference Result 524 states and 596 transitions. [2022-11-02 20:20:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-02 20:20:02,085 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 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 38 [2022-11-02 20:20:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:02,088 INFO L225 Difference]: With dead ends: 524 [2022-11-02 20:20:02,088 INFO L226 Difference]: Without dead ends: 524 [2022-11-02 20:20:02,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=496, Invalid=3540, Unknown=12, NotChecked=508, Total=4556 [2022-11-02 20:20:02,090 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1035 mSDsluCounter, 1817 mSDsCounter, 0 mSdLazyCounter, 1488 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 3785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2205 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:02,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1898 Invalid, 3785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1488 Invalid, 0 Unknown, 2205 Unchecked, 1.2s Time] [2022-11-02 20:20:02,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-11-02 20:20:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 275. [2022-11-02 20:20:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.3375) internal successors, (321), 274 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 321 transitions. [2022-11-02 20:20:02,099 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 321 transitions. Word has length 38 [2022-11-02 20:20:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:02,099 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 321 transitions. [2022-11-02 20:20:02,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 2.488372093023256) internal successors, (107), 44 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:02,100 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 321 transitions. [2022-11-02 20:20:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:20:02,100 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:02,100 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:02,143 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-02 20:20:02,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:02,314 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:20:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash -247701984, now seen corresponding path program 2 times [2022-11-02 20:20:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:02,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040895062] [2022-11-02 20:20:02,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:02,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:03,482 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:03,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:03,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040895062] [2022-11-02 20:20:03,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040895062] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:03,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726362222] [2022-11-02 20:20:03,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:20:03,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:03,484 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:03,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:03,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:20:03,626 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:20:03,627 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:20:03,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-02 20:20:03,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:03,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:20:03,746 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:20:03,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:20:03,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:03,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:04,031 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:20:04,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:20:04,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-02 20:20:04,056 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:20:04,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:20:04,222 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:20:04,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:20:04,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:04,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:04,375 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:20:04,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:20:04,408 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:20:04,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:20:04,521 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:20:04,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:20:04,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-02 20:20:04,555 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:20:04,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-11-02 20:20:04,865 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:20:04,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 55 [2022-11-02 20:20:04,904 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:20:04,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:20:04,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-02 20:20:05,111 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:20:05,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2022-11-02 20:20:05,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:20:05,590 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:05,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:20:05,598 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:05,606 INFO L356 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-11-02 20:20:05,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 29 [2022-11-02 20:20:05,616 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:05,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:05,983 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 4)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) is different from false [2022-11-02 20:20:06,104 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (<= (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) is different from false [2022-11-02 20:20:06,135 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 4)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) is different from false [2022-11-02 20:20:06,194 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int))) (or (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_917) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))) is different from false [2022-11-02 20:20:06,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:06,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 139 [2022-11-02 20:20:06,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:06,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 130 [2022-11-02 20:20:06,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 22 [2022-11-02 20:20:07,761 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) .cse0 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) |c_ULTIMATE.start_main_~x~0#1.base|))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_4) v_prenex_2 v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_3) 4)) (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| v_prenex_2) 0)))) (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int)) (v_arrayElimCell_104 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_104) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_917) v_arrayElimCell_104 v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 1) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse1) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) .cse1 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|))))))) is different from false [2022-11-02 20:20:07,858 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (= (select |c_#valid| .cse0) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_11) .cse0 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int)) (v_arrayElimCell_104 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_104) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_917) v_arrayElimCell_104 v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 1) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_11 |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_923 (Array Int Int))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_11) .cse1 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (not (= (select |c_#valid| .cse1) 0))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (not (<= 0 v_prenex_3)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_prenex_4) v_prenex_2 v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_3) 4)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| v_prenex_2) 0))))) is different from false [2022-11-02 20:20:07,970 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int)) (v_arrayElimCell_104 Int)) (or (not (= (select |c_#valid| v_arrayElimCell_104) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_917) v_arrayElimCell_104 v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 1))) (forall ((v_subst_1 Int)) (or (not (<= 0 v_subst_1)) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_11 v_subst_1))) (or (not (= (select |c_#valid| .cse1) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_11) .cse1 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) .cse1)))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (forall ((v_subst_2 Int)) (or (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_11 v_subst_2))) (or (not (= (select |c_#valid| .cse2) 0)) (forall ((v_ArrVal_923 (Array Int Int))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_11) .cse2 v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))))) (not (<= 0 v_subst_2)))) (forall ((v_prenex_2 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_prenex_4) v_prenex_2 v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_3) 4)) (not (<= 0 v_prenex_3)) (not (<= v_prenex_3 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| v_prenex_2) 0)))))) is different from false [2022-11-02 20:20:08,123 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:20:08,139 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 71 [2022-11-02 20:20:08,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 56 treesize of output 52 [2022-11-02 20:20:08,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 24 [2022-11-02 20:20:08,387 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-02 20:20:08,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:08,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 40 [2022-11-02 20:20:08,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-11-02 20:20:08,549 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:20:08,555 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:08,569 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-02 20:20:08,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-11-02 20:20:08,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-02 20:20:08,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:08,675 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:08,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-02 20:20:08,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2022-11-02 20:20:09,519 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-02 20:20:09,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726362222] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:09,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:20:09,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 47 [2022-11-02 20:20:09,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064860594] [2022-11-02 20:20:09,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:09,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:20:09,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:09,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:20:09,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1474, Unknown=11, NotChecked=588, Total=2256 [2022-11-02 20:20:09,522 INFO L87 Difference]: Start difference. First operand 275 states and 321 transitions. Second operand has 48 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 48 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:20,328 WARN L234 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 137 DAG size of output: 34 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:20:22,256 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|))) (let ((.cse4 (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse5 (= (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (.cse7 (= 8 (select |c_#length| |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse6 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse8 (= .cse3 |c_ULTIMATE.start_main_~x~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_23|) 0)) (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_923 (Array Int Int)) (v_ArrVal_916 Int) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int))) (or (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_917) |v_ULTIMATE.start_main_#t~malloc3#1.base_23| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 8) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc3#1.base_23| v_ArrVal_916) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_23|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_23| v_ArrVal_923) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))))) (= .cse0 1) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ (select .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_92|) 8) (select |c_#length| (select .cse2 |v_ULTIMATE.start_main_~x~0#1.offset_92|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)))) (not (= .cse3 |c_ULTIMATE.start_main_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) .cse4 .cse5 (= .cse6 1) (<= 0 |c_ULTIMATE.start_main_~x~0#1.offset|) (= (select |c_#valid| .cse3) 1) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_92| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (<= 0 (+ (select .cse1 |v_ULTIMATE.start_main_~x~0#1.offset_92|) 4)))) .cse7 (or (= |c_ULTIMATE.start_main_~marked~0#1| 0) (and .cse4 (= |c_ULTIMATE.start_main_~marked~0#1| .cse0) .cse5 .cse7 .cse8 (= .cse6 |c_ULTIMATE.start_main_~marked~0#1|))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_23|) 0)) (forall ((v_ArrVal_922 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_92| Int) (v_ArrVal_917 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_92| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_92|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_917) |v_ULTIMATE.start_main_#t~malloc3#1.base_23| v_ArrVal_922) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_92|) 4)))))) .cse8)))) is different from false [2022-11-02 20:20:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:30,170 INFO L93 Difference]: Finished difference Result 601 states and 689 transitions. [2022-11-02 20:20:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-02 20:20:30,171 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 48 states have internal predecessors, (111), 0 states have call successors, (0), 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 38 [2022-11-02 20:20:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:30,174 INFO L225 Difference]: With dead ends: 601 [2022-11-02 20:20:30,174 INFO L226 Difference]: Without dead ends: 601 [2022-11-02 20:20:30,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 1269 ImplicationChecksByTransitivity, 21.9s TimeCoverageRelationStatistics Valid=518, Invalid=3783, Unknown=21, NotChecked=1080, Total=5402 [2022-11-02 20:20:30,178 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 684 mSDsluCounter, 2263 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 4356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2698 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:30,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [684 Valid, 2379 Invalid, 4356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1581 Invalid, 0 Unknown, 2698 Unchecked, 1.5s Time] [2022-11-02 20:20:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-11-02 20:20:30,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 288. [2022-11-02 20:20:30,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 253 states have (on average 1.33201581027668) internal successors, (337), 287 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:30,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 337 transitions. [2022-11-02 20:20:30,188 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 337 transitions. Word has length 38 [2022-11-02 20:20:30,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:30,188 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 337 transitions. [2022-11-02 20:20:30,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.3617021276595747) internal successors, (111), 48 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:30,189 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 337 transitions. [2022-11-02 20:20:30,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:20:30,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:30,190 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:30,241 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:30,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:30,406 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:20:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:30,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1346119360, now seen corresponding path program 1 times [2022-11-02 20:20:30,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:30,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941684992] [2022-11-02 20:20:30,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:30,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:30,457 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:20:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:30,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941684992] [2022-11-02 20:20:30,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941684992] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:20:30,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:20:30,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:20:30,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406847516] [2022-11-02 20:20:30,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:20:30,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:20:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:30,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:20:30,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:30,461 INFO L87 Difference]: Start difference. First operand 288 states and 337 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:30,483 INFO L93 Difference]: Finished difference Result 314 states and 361 transitions. [2022-11-02 20:20:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:20:30,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 38 [2022-11-02 20:20:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:30,485 INFO L225 Difference]: With dead ends: 314 [2022-11-02 20:20:30,485 INFO L226 Difference]: Without dead ends: 314 [2022-11-02 20:20:30,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:20:30,486 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 39 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:30,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 263 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:20:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-11-02 20:20:30,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 288. [2022-11-02 20:20:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 253 states have (on average 1.316205533596838) internal successors, (333), 287 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:30,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 333 transitions. [2022-11-02 20:20:30,493 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 333 transitions. Word has length 38 [2022-11-02 20:20:30,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:30,493 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 333 transitions. [2022-11-02 20:20:30,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 333 transitions. [2022-11-02 20:20:30,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:20:30,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:30,495 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:30,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:20:30,495 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:20:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:30,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1486667970, now seen corresponding path program 1 times [2022-11-02 20:20:30,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:30,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218103039] [2022-11-02 20:20:30,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:31,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:31,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:31,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218103039] [2022-11-02 20:20:31,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218103039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:31,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861484912] [2022-11-02 20:20:31,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:31,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:31,578 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:31,583 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:31,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:20:31,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:31,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 65 conjunts are in the unsatisfiable core [2022-11-02 20:20:31,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:31,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:20:31,936 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:20:31,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:20:32,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:32,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:32,256 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:20:32,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:20:32,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-02 20:20:32,286 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:20:32,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:20:32,459 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:20:32,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:20:32,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:20:32,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:32,607 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:20:32,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:20:32,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:32,732 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:20:32,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-11-02 20:20:32,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:33,037 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:20:33,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:20:33,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-11-02 20:20:33,083 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:20:33,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 55 [2022-11-02 20:20:33,273 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:20:33,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2022-11-02 20:20:33,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:20:33,722 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:33,728 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:20:33,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2022-11-02 20:20:33,738 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:33,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:20:33,743 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:33,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:34,133 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1102 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 4)))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|)))))) is different from false [2022-11-02 20:20:34,273 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1102 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 4)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|))))) is different from false [2022-11-02 20:20:34,304 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1102 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 4)))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))))) is different from false [2022-11-02 20:20:34,362 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))) (forall ((v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1098) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|))))) is different from false [2022-11-02 20:20:34,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:34,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 139 [2022-11-02 20:20:34,664 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:34,664 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 133 treesize of output 130 [2022-11-02 20:20:34,780 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 treesize of output 22 [2022-11-02 20:20:35,399 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_28| Int) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_28|) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1098) |v_ULTIMATE.start_main_#t~malloc3#1.base_28| v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimCell_145 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_8) v_arrayElimCell_145 v_prenex_7) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_9) 1) (not (<= v_prenex_9 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= 0 (select |c_#valid| v_arrayElimCell_145))) (not (<= 0 v_prenex_9)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (forall ((v_prenex_9 Int)) (or (not (<= v_prenex_9 |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_16 |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1103 (Array Int Int))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_16) .cse0 v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_9)))) (not (= (select |c_#valid| .cse0) 0))))) (not (<= 0 v_prenex_9)))) (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_prenex_9 Int)) (or (not (<= v_prenex_9 |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_16 |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1103 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_16) .cse1 v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_9) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= (select |c_#valid| .cse1) 0))))) (not (<= 0 v_prenex_9))))))) is different from false [2022-11-02 20:20:35,500 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_prenex_9 Int)) (or (not (<= v_prenex_9 |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_16 |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1103 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_16) .cse0 v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_9))) (not (= (select |c_#valid| .cse0) 0))))) (not (<= 0 v_prenex_9)))))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimCell_145 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_prenex_8) v_arrayElimCell_145 v_prenex_7) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_9) 1) (not (<= v_prenex_9 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= 0 (select |c_#valid| v_arrayElimCell_145))) (not (<= 0 v_prenex_9)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_28| Int) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1098) |v_ULTIMATE.start_main_#t~malloc3#1.base_28| v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 4)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_28|) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))) (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (forall ((v_prenex_9 Int)) (or (not (<= v_prenex_9 |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 v_prenex_9)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_16 |ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_1103 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_16) .cse1 v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_9) .cse1))) (not (= (select |c_#valid| .cse1) 0))))))) (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))))) is different from false [2022-11-02 20:20:35,597 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_subst_4 Int)) (or (forall ((v_prenex_9 Int)) (or (not (<= v_prenex_9 |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_16 v_subst_4))) (or (not (= (select |c_#valid| .cse0) 0)) (forall ((v_ArrVal_1103 (Array Int Int))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_16) .cse0 v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_9)))))) (not (<= 0 v_prenex_9)))) (not (<= 0 v_subst_4)))) (forall ((v_prenex_8 (Array Int Int)) (v_arrayElimCell_145 Int) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (not (<= v_prenex_9 |c_ULTIMATE.start_main_~head~0#1.offset|)) (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_8) v_arrayElimCell_145 v_prenex_7) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_9) 1) (not (= 0 (select |c_#valid| v_arrayElimCell_145))) (not (<= 0 v_prenex_9)))) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_28| Int) (v_ArrVal_1102 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_98| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_28|) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_98| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1098) |v_ULTIMATE.start_main_#t~malloc3#1.base_28| v_ArrVal_1102) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_98|) 4)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_98|)))) (forall ((v_subst_3 Int)) (or (not (<= 0 v_subst_3)) (forall ((v_prenex_9 Int)) (or (not (<= v_prenex_9 |c_ULTIMATE.start_main_~head~0#1.offset|)) (forall ((v_arrayElimArr_16 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_16 v_subst_3))) (or (forall ((v_ArrVal_1103 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_16) .cse2 v_ArrVal_1103) |c_ULTIMATE.start_main_~head~0#1.base|) v_prenex_9) .cse2))) (not (= (select |c_#valid| .cse2) 0))))) (not (<= 0 v_prenex_9)))))))) is different from false [2022-11-02 20:20:35,749 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:35,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:20:35,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:35,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 71 [2022-11-02 20:20:35,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 56 treesize of output 52 [2022-11-02 20:20:35,787 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:35,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 56 [2022-11-02 20:20:35,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:35,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-02 20:20:35,977 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:35,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 63 [2022-11-02 20:20:35,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-11-02 20:20:35,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 46 treesize of output 42 [2022-11-02 20:20:36,276 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:36,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-02 20:20:36,303 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:36,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 84 [2022-11-02 20:20:36,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 68 treesize of output 64 [2022-11-02 20:20:36,332 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:36,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 61 [2022-11-02 20:20:36,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:36,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:20:36,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:36,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:36,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2022-11-02 20:20:36,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 9 [2022-11-02 20:20:37,424 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-11-02 20:20:37,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861484912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:37,425 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:20:37,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 46 [2022-11-02 20:20:37,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707161726] [2022-11-02 20:20:37,425 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:37,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-02 20:20:37,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:37,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-02 20:20:37,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1392, Unknown=13, NotChecked=574, Total=2162 [2022-11-02 20:20:37,428 INFO L87 Difference]: Start difference. First operand 288 states and 333 transitions. Second operand has 47 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:53,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:53,596 INFO L93 Difference]: Finished difference Result 461 states and 529 transitions. [2022-11-02 20:20:53,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-02 20:20:53,599 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 0 states have call successors, (0), 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 38 [2022-11-02 20:20:53,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:53,602 INFO L225 Difference]: With dead ends: 461 [2022-11-02 20:20:53,602 INFO L226 Difference]: Without dead ends: 461 [2022-11-02 20:20:53,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 65 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=477, Invalid=3068, Unknown=23, NotChecked=854, Total=4422 [2022-11-02 20:20:53,604 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 504 mSDsluCounter, 2192 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 3643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2355 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:53,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2298 Invalid, 3643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1244 Invalid, 0 Unknown, 2355 Unchecked, 1.1s Time] [2022-11-02 20:20:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-11-02 20:20:53,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 275. [2022-11-02 20:20:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 240 states have (on average 1.3208333333333333) internal successors, (317), 274 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 317 transitions. [2022-11-02 20:20:53,612 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 317 transitions. Word has length 38 [2022-11-02 20:20:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:53,613 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 317 transitions. [2022-11-02 20:20:53,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.4130434782608696) internal successors, (111), 47 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 317 transitions. [2022-11-02 20:20:53,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:20:53,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:53,615 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:53,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:53,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:53,842 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:20:53,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash 706221163, now seen corresponding path program 1 times [2022-11-02 20:20:53,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:53,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947187907] [2022-11-02 20:20:53,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:53,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:54,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:54,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947187907] [2022-11-02 20:20:54,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947187907] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:54,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900201996] [2022-11-02 20:20:54,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:54,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:54,411 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:54,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:20:54,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:54,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 39 conjunts are in the unsatisfiable core [2022-11-02 20:20:54,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:54,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:20:54,695 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:20:54,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:20:54,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:54,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:54,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:20:54,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:54,888 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:20:55,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:20:55,066 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:55,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-11-02 20:20:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:55,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:20:55,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 6 [2022-11-02 20:20:55,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_104| Int) (v_ArrVal_1178 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_104| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1178) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_104|)))) is different from false [2022-11-02 20:20:55,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_104| Int) (v_ArrVal_1178 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1178) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_104| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-02 20:20:55,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_104| Int) (v_ArrVal_1178 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1178) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_104|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_104| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-11-02 20:20:55,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:55,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-11-02 20:20:55,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:20:55,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-02 20:20:55,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2022-11-02 20:20:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:55,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900201996] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:20:55,843 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:20:55,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 36 [2022-11-02 20:20:55,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986138184] [2022-11-02 20:20:55,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:20:55,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-02 20:20:55,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:20:55,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-02 20:20:55,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=994, Unknown=3, NotChecked=198, Total=1332 [2022-11-02 20:20:55,846 INFO L87 Difference]: Start difference. First operand 275 states and 317 transitions. Second operand has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 37 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:20:58,135 INFO L93 Difference]: Finished difference Result 382 states and 431 transitions. [2022-11-02 20:20:58,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-02 20:20:58,135 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 37 states have internal predecessors, (107), 0 states have call successors, (0), 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 39 [2022-11-02 20:20:58,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:20:58,138 INFO L225 Difference]: With dead ends: 382 [2022-11-02 20:20:58,138 INFO L226 Difference]: Without dead ends: 382 [2022-11-02 20:20:58,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=811, Invalid=4028, Unknown=3, NotChecked=414, Total=5256 [2022-11-02 20:20:58,140 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 581 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 1673 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 880 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:20:58,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [581 Valid, 1673 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1161 Invalid, 0 Unknown, 880 Unchecked, 0.9s Time] [2022-11-02 20:20:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2022-11-02 20:20:58,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 274. [2022-11-02 20:20:58,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 245 states have (on average 1.2938775510204081) internal successors, (317), 273 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:58,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 317 transitions. [2022-11-02 20:20:58,154 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 317 transitions. Word has length 39 [2022-11-02 20:20:58,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:20:58,155 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 317 transitions. [2022-11-02 20:20:58,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.9722222222222223) internal successors, (107), 37 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:20:58,155 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 317 transitions. [2022-11-02 20:20:58,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:20:58,156 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:20:58,156 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:20:58,196 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:20:58,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 20:20:58,371 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:20:58,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:20:58,371 INFO L85 PathProgramCache]: Analyzing trace with hash 337780897, now seen corresponding path program 2 times [2022-11-02 20:20:58,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:20:58,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598786776] [2022-11-02 20:20:58,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:20:58,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:20:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:20:59,427 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:20:59,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:20:59,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598786776] [2022-11-02 20:20:59,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598786776] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:20:59,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847695806] [2022-11-02 20:20:59,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:20:59,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:20:59,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:20:59,429 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:20:59,437 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:20:59,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:20:59,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:20:59,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-02 20:20:59,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:20:59,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:20:59,760 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:20:59,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:20:59,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:20:59,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:21:00,096 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:21:00,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 20:21:00,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 7 [2022-11-02 20:21:00,128 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:00,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:21:00,259 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:00,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:21:00,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:21:00,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:21:00,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:21:00,396 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:21:00,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:21:00,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:21:00,494 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:21:00,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-11-02 20:21:00,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:21:00,764 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:21:00,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 67 [2022-11-02 20:21:00,782 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:21:00,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 26 [2022-11-02 20:21:00,797 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:00,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 76 [2022-11-02 20:21:00,917 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:21:00,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 108 treesize of output 91 [2022-11-02 20:21:00,933 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:00,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 92 [2022-11-02 20:21:00,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-02 20:21:01,244 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:01,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 48 [2022-11-02 20:21:01,254 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:01,270 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-02 20:21:01,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 31 [2022-11-02 20:21:01,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:21:01,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:01,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:01,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1307) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) is different from false [2022-11-02 20:21:01,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (or (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1307) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4)) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) is different from false [2022-11-02 20:21:01,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (or (not (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_1307) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4))) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) is different from false [2022-11-02 20:21:01,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_1300 Int) (v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1300)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1307) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4)) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) is different from false [2022-11-02 20:21:01,993 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:01,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 53 [2022-11-02 20:21:02,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:02,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 58 [2022-11-02 20:21:02,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:02,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 102 [2022-11-02 20:21:02,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 62 treesize of output 46 [2022-11-02 20:21:02,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-11-02 20:21:02,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:02,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-11-02 20:21:02,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:02,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 84 [2022-11-02 20:21:02,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 68 treesize of output 64 [2022-11-02 20:21:02,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:02,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 61 [2022-11-02 20:21:03,157 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:03,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-02 20:21:03,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:03,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 121 [2022-11-02 20:21:03,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 53 treesize of output 49 [2022-11-02 20:21:03,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 102 treesize of output 94 [2022-11-02 20:21:03,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:03,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:21:03,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:03,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 133 [2022-11-02 20:21:03,379 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:03,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 116 [2022-11-02 20:21:03,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 102 treesize of output 94 [2022-11-02 20:21:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-11-02 20:21:04,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847695806] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:04,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:04,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 51 [2022-11-02 20:21:04,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239304931] [2022-11-02 20:21:04,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:04,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 20:21:04,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:04,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 20:21:04,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1963, Unknown=17, NotChecked=372, Total=2550 [2022-11-02 20:21:04,186 INFO L87 Difference]: Start difference. First operand 274 states and 317 transitions. Second operand has 51 states, 51 states have (on average 2.392156862745098) internal successors, (122), 51 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-11-02 20:21:06,983 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 0)) (.cse2 (not (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (.cse5 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (and .cse0 (not (= .cse1 |c_ULTIMATE.start_main_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) .cse2 (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1303 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_108| Int) (v_ArrVal_1300 Int) (v_ArrVal_1309 (Array Int Int)) (v_ArrVal_1308 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_1300)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1307) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1308) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_108|) 4)) 0)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_108| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_108|)))) (not (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= .cse1 |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (= .cse4 0) (= .cse5 1) (= (select |c_#valid| .cse1) 1) (= (select .cse3 (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4)) 1) (or (= |c_ULTIMATE.start_main_~marked~0#1| 0) (and .cse0 .cse2 (= .cse5 |c_ULTIMATE.start_main_~marked~0#1|))) (= .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~x~0#1.offset| .cse4))) is different from false [2022-11-02 20:21:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:11,003 INFO L93 Difference]: Finished difference Result 523 states and 597 transitions. [2022-11-02 20:21:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-11-02 20:21:11,003 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.392156862745098) internal successors, (122), 51 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) Word has length 43 [2022-11-02 20:21:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:11,006 INFO L225 Difference]: With dead ends: 523 [2022-11-02 20:21:11,006 INFO L226 Difference]: Without dead ends: 523 [2022-11-02 20:21:11,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 63 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2001 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=777, Invalid=6517, Unknown=36, NotChecked=860, Total=8190 [2022-11-02 20:21:11,008 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 544 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 3300 SdHoareTripleChecker+Invalid, 4434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2595 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:11,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 3300 Invalid, 4434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 1694 Invalid, 0 Unknown, 2595 Unchecked, 1.4s Time] [2022-11-02 20:21:11,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-02 20:21:11,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 313. [2022-11-02 20:21:11,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 284 states have (on average 1.2816901408450705) internal successors, (364), 312 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 364 transitions. [2022-11-02 20:21:11,016 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 364 transitions. Word has length 43 [2022-11-02 20:21:11,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:11,016 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 364 transitions. [2022-11-02 20:21:11,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.392156862745098) internal successors, (122), 51 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-11-02 20:21:11,017 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 364 transitions. [2022-11-02 20:21:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-02 20:21:11,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:11,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:11,048 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:11,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:21:11,235 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2022-11-02 20:21:11,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:11,235 INFO L85 PathProgramCache]: Analyzing trace with hash -774106862, now seen corresponding path program 1 times [2022-11-02 20:21:11,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:11,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753983927] [2022-11-02 20:21:11,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:11,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:11,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:11,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:11,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753983927] [2022-11-02 20:21:11,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753983927] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:11,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776400327] [2022-11-02 20:21:11,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:11,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:11,975 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:11,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e6044b5d-4765-4dbc-9cab-d0916f461747/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:21:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,142 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-02 20:21:12,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:12,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:21:12,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:21:12,241 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:21:12,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:21:12,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:21:12,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:21:12,436 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:21:12,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2022-11-02 20:21:12,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:21:12,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-11-02 20:21:12,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:21:12,576 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-11-02 20:21:12,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 75 [2022-11-02 20:21:12,595 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-02 20:21:12,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 55 [2022-11-02 20:21:12,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:12,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:21:13,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:13,373 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:13,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:13,382 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-02 20:21:13,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 42 [2022-11-02 20:21:13,388 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:13,394 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:21:13,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-11-02 20:21:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:13,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:35,530 INFO L356 Elim1Store]: treesize reduction 273, result has 68.5 percent of original size [2022-11-02 20:21:35,531 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 438914 treesize of output 412751 [2022-11-02 20:21:45,640 WARN L234 SmtUtils]: Spent 10.11s on a formula simplification. DAG size of input: 545 DAG size of output: 544 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:21:46,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:50,224 INFO L356 Elim1Store]: treesize reduction 606, result has 56.1 percent of original size [2022-11-02 20:21:50,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 16 new quantified variables, introduced 106 case distinctions, treesize of input 3349315 treesize of output 3266443