./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/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_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/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_a3053fa4-590b-42aa-907f-bf088a9d23da/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 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 19:53:17,396 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:53:17,399 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:53:17,449 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:53:17,450 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:53:17,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:53:17,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:53:17,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:53:17,466 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:53:17,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:53:17,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:53:17,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:53:17,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:53:17,479 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:53:17,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:53:17,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:53:17,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:53:17,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:53:17,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:53:17,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:53:17,498 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:53:17,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:53:17,503 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:53:17,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:53:17,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:53:17,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:53:17,514 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:53:17,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:53:17,517 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:53:17,518 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:53:17,519 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:53:17,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:53:17,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:53:17,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:53:17,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:53:17,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:53:17,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:53:17,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:53:17,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:53:17,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:53:17,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:53:17,530 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 19:53:17,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:53:17,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:53:17,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:53:17,573 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:53:17,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:53:17,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:53:17,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:53:17,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:53:17,575 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:53:17,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:53:17,577 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 19:53:17,577 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 19:53:17,577 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:53:17,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 19:53:17,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:53:17,578 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 19:53:17,579 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 19:53:17,579 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 19:53:17,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:53:17,579 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 19:53:17,580 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 19:53:17,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:53:17,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:53:17,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:53:17,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:53:17,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:53:17,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:53:17,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:53:17,582 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 19:53:17,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 19:53:17,584 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_a3053fa4-590b-42aa-907f-bf088a9d23da/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_a3053fa4-590b-42aa-907f-bf088a9d23da/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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2022-11-02 19:53:17,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:53:17,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:53:17,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:53:17,936 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:53:17,938 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:53:17,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2022-11-02 19:53:18,011 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data/cc8c732f2/739cde1fb2cf4fea97e019e62f4b503e/FLAG440e713b5 [2022-11-02 19:53:18,554 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:53:18,555 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2022-11-02 19:53:18,577 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data/cc8c732f2/739cde1fb2cf4fea97e019e62f4b503e/FLAG440e713b5 [2022-11-02 19:53:18,890 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data/cc8c732f2/739cde1fb2cf4fea97e019e62f4b503e [2022-11-02 19:53:18,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:53:18,895 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:53:18,899 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:53:18,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:53:18,903 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:53:18,904 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:53:18" (1/1) ... [2022-11-02 19:53:18,906 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73e013b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:18, skipping insertion in model container [2022-11-02 19:53:18,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:53:18" (1/1) ... [2022-11-02 19:53:18,915 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:53:18,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:53:19,404 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-11-02 19:53:19,411 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-11-02 19:53:19,412 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-11-02 19:53:19,413 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-11-02 19:53:19,416 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-11-02 19:53:19,419 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-11-02 19:53:19,421 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-11-02 19:53:19,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:53:19,448 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:53:19,501 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-11-02 19:53:19,505 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-11-02 19:53:19,506 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-11-02 19:53:19,513 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-11-02 19:53:19,516 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-11-02 19:53:19,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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-11-02 19:53:19,520 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-11-02 19:53:19,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:53:19,561 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:53:19,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19 WrapperNode [2022-11-02 19:53:19,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:53:19,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:53:19,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:53:19,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:53:19,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,641 INFO L138 Inliner]: procedures = 119, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 165 [2022-11-02 19:53:19,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:53:19,643 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:53:19,643 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:53:19,643 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:53:19,653 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,654 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,674 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,675 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,682 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,702 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,704 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:53:19,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:53:19,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:53:19,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:53:19,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (1/1) ... [2022-11-02 19:53:19,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:53:19,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:53:19,768 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:53:19,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:53:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 19:53:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 19:53:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 19:53:19,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:53:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 19:53:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 19:53:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 19:53:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 19:53:19,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:53:19,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:53:20,006 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:53:20,023 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:53:20,595 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:53:20,603 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:53:20,603 INFO L300 CfgBuilder]: Removed 17 assume(true) statements. [2022-11-02 19:53:20,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:53:20 BoogieIcfgContainer [2022-11-02 19:53:20,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:53:20,609 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:53:20,609 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:53:20,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:53:20,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:53:18" (1/3) ... [2022-11-02 19:53:20,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b92d418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:53:20, skipping insertion in model container [2022-11-02 19:53:20,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:19" (2/3) ... [2022-11-02 19:53:20,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b92d418 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:53:20, skipping insertion in model container [2022-11-02 19:53:20,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:53:20" (3/3) ... [2022-11-02 19:53:20,616 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2022-11-02 19:53:20,636 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:53:20,637 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-11-02 19:53:20,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:53:20,698 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;@79bb3e09, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:53:20,698 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-11-02 19:53:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 166 states, 88 states have (on average 2.215909090909091) internal successors, (195), 165 states have internal predecessors, (195), 0 states have call successors, (0), 0 states 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 19:53:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 19:53:20,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:20,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 19:53:20,712 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:20,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:20,719 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 19:53:20,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:20,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091831268] [2022-11-02 19:53:20,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:20,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:20,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:20,995 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 19:53:20,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:20,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091831268] [2022-11-02 19:53:20,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091831268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:21,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:21,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:53:21,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413384312] [2022-11-02 19:53:21,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:21,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:21,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:21,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:21,048 INFO L87 Difference]: Start difference. First operand has 166 states, 88 states have (on average 2.215909090909091) internal successors, (195), 165 states have internal predecessors, (195), 0 states have call successors, (0), 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 19:53:21,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:21,276 INFO L93 Difference]: Finished difference Result 193 states and 199 transitions. [2022-11-02 19:53:21,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:21,279 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 19:53:21,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:21,288 INFO L225 Difference]: With dead ends: 193 [2022-11-02 19:53:21,289 INFO L226 Difference]: Without dead ends: 189 [2022-11-02 19:53:21,290 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 19:53:21,294 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 151 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:21,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 112 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:53:21,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-11-02 19:53:21,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 161. [2022-11-02 19:53:21,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 87 states have (on average 1.9080459770114941) internal successors, (166), 160 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:21,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 166 transitions. [2022-11-02 19:53:21,337 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 166 transitions. Word has length 3 [2022-11-02 19:53:21,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:21,337 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 166 transitions. [2022-11-02 19:53:21,338 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 19:53:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 166 transitions. [2022-11-02 19:53:21,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 19:53:21,338 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:21,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 19:53:21,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 19:53:21,339 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:21,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:21,340 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 19:53:21,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:21,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793766342] [2022-11-02 19:53:21,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:21,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:21,427 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 19:53:21,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:21,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793766342] [2022-11-02 19:53:21,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793766342] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:21,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:21,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:53:21,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593138283] [2022-11-02 19:53:21,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:21,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:21,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:21,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:21,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:21,431 INFO L87 Difference]: Start difference. First operand 161 states and 166 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 19:53:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:21,587 INFO L93 Difference]: Finished difference Result 158 states and 163 transitions. [2022-11-02 19:53:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:21,587 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 19:53:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:21,593 INFO L225 Difference]: With dead ends: 158 [2022-11-02 19:53:21,594 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 19:53:21,600 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 19:53:21,601 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 158 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:21,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 91 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:53:21,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 19:53:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-11-02 19:53:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 87 states have (on average 1.8735632183908046) internal successors, (163), 157 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 163 transitions. [2022-11-02 19:53:21,623 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 163 transitions. Word has length 3 [2022-11-02 19:53:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:21,623 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 163 transitions. [2022-11-02 19:53:21,623 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 19:53:21,623 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 163 transitions. [2022-11-02 19:53:21,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 19:53:21,624 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:21,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:21,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 19:53:21,624 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:21,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:21,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2022-11-02 19:53:21,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:21,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934504557] [2022-11-02 19:53:21,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:21,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:21,734 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 19:53:21,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:21,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934504557] [2022-11-02 19:53:21,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934504557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:21,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:21,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:53:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215455204] [2022-11-02 19:53:21,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:21,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:21,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:21,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:21,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:21,737 INFO L87 Difference]: Start difference. First operand 158 states and 163 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:21,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:21,907 INFO L93 Difference]: Finished difference Result 157 states and 162 transitions. [2022-11-02 19:53:21,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:21,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 19:53:21,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:21,908 INFO L225 Difference]: With dead ends: 157 [2022-11-02 19:53:21,909 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 19:53:21,909 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 19:53:21,910 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 135 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:21,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 97 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:53:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 19:53:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2022-11-02 19:53:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 89 states have (on average 1.797752808988764) internal successors, (160), 152 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 160 transitions. [2022-11-02 19:53:21,930 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 160 transitions. Word has length 7 [2022-11-02 19:53:21,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:21,931 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 160 transitions. [2022-11-02 19:53:21,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 160 transitions. [2022-11-02 19:53:21,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 19:53:21,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:21,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:21,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 19:53:21,932 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:21,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:21,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2022-11-02 19:53:21,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:21,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826525738] [2022-11-02 19:53:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:21,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:22,168 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 19:53:22,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:22,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826525738] [2022-11-02 19:53:22,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826525738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:22,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:22,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:53:22,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329613913] [2022-11-02 19:53:22,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:22,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:22,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:22,171 INFO L87 Difference]: Start difference. First operand 153 states and 160 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:22,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:22,308 INFO L93 Difference]: Finished difference Result 170 states and 176 transitions. [2022-11-02 19:53:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:22,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 19:53:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:22,309 INFO L225 Difference]: With dead ends: 170 [2022-11-02 19:53:22,310 INFO L226 Difference]: Without dead ends: 170 [2022-11-02 19:53:22,310 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 19:53:22,319 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 131 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:22,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 104 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:53:22,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-11-02 19:53:22,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 157. [2022-11-02 19:53:22,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.7083333333333333) internal successors, (164), 156 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 164 transitions. [2022-11-02 19:53:22,330 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 164 transitions. Word has length 7 [2022-11-02 19:53:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:22,330 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 164 transitions. [2022-11-02 19:53:22,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:22,331 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 164 transitions. [2022-11-02 19:53:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 19:53:22,331 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:22,331 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:22,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 19:53:22,332 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:22,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:22,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214510, now seen corresponding path program 1 times [2022-11-02 19:53:22,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:22,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801523199] [2022-11-02 19:53:22,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:22,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:22,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:22,571 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 19:53:22,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:22,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801523199] [2022-11-02 19:53:22,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801523199] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:22,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:22,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:53:22,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128929352] [2022-11-02 19:53:22,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:22,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:53:22,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:22,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:53:22,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:53:22,577 INFO L87 Difference]: Start difference. First operand 157 states and 164 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:22,782 INFO L93 Difference]: Finished difference Result 158 states and 166 transitions. [2022-11-02 19:53:22,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:53:22,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 19:53:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:22,787 INFO L225 Difference]: With dead ends: 158 [2022-11-02 19:53:22,787 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 19:53:22,788 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 19:53:22,794 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 214 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:22,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 81 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:53:22,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 19:53:22,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 144. [2022-11-02 19:53:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 98 states have (on average 1.5612244897959184) internal successors, (153), 143 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 153 transitions. [2022-11-02 19:53:22,813 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 153 transitions. Word has length 13 [2022-11-02 19:53:22,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:22,813 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 153 transitions. [2022-11-02 19:53:22,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:22,814 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 153 transitions. [2022-11-02 19:53:22,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-02 19:53:22,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:22,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:22,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 19:53:22,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:22,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:22,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1253214511, now seen corresponding path program 1 times [2022-11-02 19:53:22,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:22,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94018685] [2022-11-02 19:53:22,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:22,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:23,111 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 19:53:23,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:23,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94018685] [2022-11-02 19:53:23,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94018685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:23,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:23,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:53:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778566417] [2022-11-02 19:53:23,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:23,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:53:23,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:23,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:53:23,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:53:23,115 INFO L87 Difference]: Start difference. First operand 144 states and 153 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:23,378 INFO L93 Difference]: Finished difference Result 183 states and 193 transitions. [2022-11-02 19:53:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:53:23,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-11-02 19:53:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:23,380 INFO L225 Difference]: With dead ends: 183 [2022-11-02 19:53:23,380 INFO L226 Difference]: Without dead ends: 183 [2022-11-02 19:53:23,380 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 19:53:23,383 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 178 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:23,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 121 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:53:23,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-02 19:53:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 154. [2022-11-02 19:53:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 109 states have (on average 1.5229357798165137) internal successors, (166), 153 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:23,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2022-11-02 19:53:23,394 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 13 [2022-11-02 19:53:23,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:23,394 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2022-11-02 19:53:23,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:23,395 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2022-11-02 19:53:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 19:53:23,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:23,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:23,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 19:53:23,396 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:23,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:23,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1748354145, now seen corresponding path program 1 times [2022-11-02 19:53:23,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:23,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801792385] [2022-11-02 19:53:23,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:23,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:23,518 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 19:53:23,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:23,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801792385] [2022-11-02 19:53:23,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801792385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:23,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:23,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:53:23,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210440495] [2022-11-02 19:53:23,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:23,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:53:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:53:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:23,521 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:23,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:23,743 INFO L93 Difference]: Finished difference Result 197 states and 206 transitions. [2022-11-02 19:53:23,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:53:23,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 19:53:23,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:23,746 INFO L225 Difference]: With dead ends: 197 [2022-11-02 19:53:23,746 INFO L226 Difference]: Without dead ends: 197 [2022-11-02 19:53:23,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:23,748 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 301 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:23,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 153 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:53:23,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-02 19:53:23,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 152. [2022-11-02 19:53:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.5) internal successors, (162), 151 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:23,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2022-11-02 19:53:23,753 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 15 [2022-11-02 19:53:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:23,754 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2022-11-02 19:53:23,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2022-11-02 19:53:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 19:53:23,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:23,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:23,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 19:53:23,755 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:23,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:23,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230725, now seen corresponding path program 1 times [2022-11-02 19:53:23,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:23,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090588486] [2022-11-02 19:53:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:23,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:23,912 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 19:53:23,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:23,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090588486] [2022-11-02 19:53:23,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090588486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:23,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:23,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:53:23,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241428265] [2022-11-02 19:53:23,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:23,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:53:23,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:23,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:53:23,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:23,915 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:24,091 INFO L93 Difference]: Finished difference Result 151 states and 160 transitions. [2022-11-02 19:53:24,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:53:24,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 19:53:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:24,093 INFO L225 Difference]: With dead ends: 151 [2022-11-02 19:53:24,093 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 19:53:24,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:24,100 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 9 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:24,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 342 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:53:24,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 19:53:24,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-02 19:53:24,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 150 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:24,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 160 transitions. [2022-11-02 19:53:24,105 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 160 transitions. Word has length 16 [2022-11-02 19:53:24,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:24,105 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 160 transitions. [2022-11-02 19:53:24,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:24,105 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 160 transitions. [2022-11-02 19:53:24,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 19:53:24,106 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:24,106 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:24,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 19:53:24,107 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:24,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:24,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1637230724, now seen corresponding path program 1 times [2022-11-02 19:53:24,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:24,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369803821] [2022-11-02 19:53:24,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:24,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:24,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:24,434 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 19:53:24,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:24,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369803821] [2022-11-02 19:53:24,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369803821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:24,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:24,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:53:24,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737870817] [2022-11-02 19:53:24,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:24,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:53:24,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:24,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:53:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:24,438 INFO L87 Difference]: Start difference. First operand 151 states and 160 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:24,780 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-11-02 19:53:24,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:53:24,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-02 19:53:24,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:24,782 INFO L225 Difference]: With dead ends: 150 [2022-11-02 19:53:24,782 INFO L226 Difference]: Without dead ends: 150 [2022-11-02 19:53:24,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:24,785 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 4 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:24,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 327 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:53:24,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-02 19:53:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-02 19:53:24,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 108 states have (on average 1.462962962962963) internal successors, (158), 149 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:24,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 158 transitions. [2022-11-02 19:53:24,789 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 158 transitions. Word has length 16 [2022-11-02 19:53:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:24,789 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 158 transitions. [2022-11-02 19:53:24,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 158 transitions. [2022-11-02 19:53:24,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 19:53:24,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:24,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:24,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 19:53:24,792 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:24,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:24,796 INFO L85 PathProgramCache]: Analyzing trace with hash 154003716, now seen corresponding path program 1 times [2022-11-02 19:53:24,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:24,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500529321] [2022-11-02 19:53:24,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:24,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:25,140 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 19:53:25,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:25,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500529321] [2022-11-02 19:53:25,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500529321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:25,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:25,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:53:25,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559498182] [2022-11-02 19:53:25,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:25,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:53:25,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:25,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:53:25,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:53:25,143 INFO L87 Difference]: Start difference. First operand 150 states and 158 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:25,524 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2022-11-02 19:53:25,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 19:53:25,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-02 19:53:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:25,526 INFO L225 Difference]: With dead ends: 204 [2022-11-02 19:53:25,526 INFO L226 Difference]: Without dead ends: 204 [2022-11-02 19:53:25,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:53:25,527 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 369 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:25,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 338 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:53:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-11-02 19:53:25,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 155. [2022-11-02 19:53:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 113 states have (on average 1.4424778761061947) internal successors, (163), 154 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:25,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 163 transitions. [2022-11-02 19:53:25,531 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 163 transitions. Word has length 18 [2022-11-02 19:53:25,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:25,532 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 163 transitions. [2022-11-02 19:53:25,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 163 transitions. [2022-11-02 19:53:25,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 19:53:25,533 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:25,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:25,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 19:53:25,533 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:25,534 INFO L85 PathProgramCache]: Analyzing trace with hash 510771581, now seen corresponding path program 1 times [2022-11-02 19:53:25,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:25,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365361735] [2022-11-02 19:53:25,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:25,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:25,796 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 19:53:25,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:25,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365361735] [2022-11-02 19:53:25,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365361735] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:25,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:25,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:53:25,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886011201] [2022-11-02 19:53:25,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:25,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:53:25,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:25,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:53:25,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:53:25,799 INFO L87 Difference]: Start difference. First operand 155 states and 163 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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 19:53:26,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:26,210 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2022-11-02 19:53:26,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:53:26,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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 20 [2022-11-02 19:53:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:26,212 INFO L225 Difference]: With dead ends: 154 [2022-11-02 19:53:26,212 INFO L226 Difference]: Without dead ends: 154 [2022-11-02 19:53:26,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-02 19:53:26,213 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 183 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:26,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 266 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:53:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-02 19:53:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2022-11-02 19:53:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 113 states have (on average 1.4336283185840708) internal successors, (162), 153 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:26,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 162 transitions. [2022-11-02 19:53:26,217 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 162 transitions. Word has length 20 [2022-11-02 19:53:26,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:26,217 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 162 transitions. [2022-11-02 19:53:26,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 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 19:53:26,218 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 162 transitions. [2022-11-02 19:53:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 19:53:26,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:26,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:26,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 19:53:26,219 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:26,220 INFO L85 PathProgramCache]: Analyzing trace with hash 510771582, now seen corresponding path program 1 times [2022-11-02 19:53:26,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:26,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040586291] [2022-11-02 19:53:26,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:26,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:26,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:26,728 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 19:53:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:26,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040586291] [2022-11-02 19:53:26,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040586291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:26,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:26,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 19:53:26,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679392298] [2022-11-02 19:53:26,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:26,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:53:26,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:26,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:53:26,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:53:26,731 INFO L87 Difference]: Start difference. First operand 154 states and 162 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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 19:53:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:27,472 INFO L93 Difference]: Finished difference Result 172 states and 181 transitions. [2022-11-02 19:53:27,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 19:53:27,473 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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 20 [2022-11-02 19:53:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:27,474 INFO L225 Difference]: With dead ends: 172 [2022-11-02 19:53:27,474 INFO L226 Difference]: Without dead ends: 172 [2022-11-02 19:53:27,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:53:27,475 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 233 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:27,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 359 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:53:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-02 19:53:27,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 158. [2022-11-02 19:53:27,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 123 states have (on average 1.3821138211382114) internal successors, (170), 157 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:27,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2022-11-02 19:53:27,479 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 20 [2022-11-02 19:53:27,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:27,480 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2022-11-02 19:53:27,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 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 19:53:27,480 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2022-11-02 19:53:27,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 19:53:27,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:27,484 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] [2022-11-02 19:53:27,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 19:53:27,484 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:27,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:27,485 INFO L85 PathProgramCache]: Analyzing trace with hash 2006006511, now seen corresponding path program 1 times [2022-11-02 19:53:27,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:27,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198650160] [2022-11-02 19:53:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:27,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:27,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:27,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198650160] [2022-11-02 19:53:27,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198650160] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:53:27,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23791136] [2022-11-02 19:53:27,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:27,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:53:27,775 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:53:27,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:53:27,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 19:53:27,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:27,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 19:53:27,925 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:28,030 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 19:53:28,038 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 19:53:28,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:53:28,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:53:28,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:53:28,127 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:53:28,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:53:28,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:53:28,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 19:53:28,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:53:28,350 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 19:53:28,359 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 19:53:28,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:28,402 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:53:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:28,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23791136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:53:28,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:53:28,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 6] total 12 [2022-11-02 19:53:28,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722358284] [2022-11-02 19:53:28,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:53:28,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:53:28,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:28,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:53:28,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:53:28,500 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 19:53:29,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:29,099 INFO L93 Difference]: Finished difference Result 209 states and 225 transitions. [2022-11-02 19:53:29,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 19:53:29,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 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 25 [2022-11-02 19:53:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:29,101 INFO L225 Difference]: With dead ends: 209 [2022-11-02 19:53:29,101 INFO L226 Difference]: Without dead ends: 209 [2022-11-02 19:53:29,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-11-02 19:53:29,102 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 231 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:29,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 521 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:53:29,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-02 19:53:29,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 165. [2022-11-02 19:53:29,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 164 states have internal predecessors, (178), 0 states have call successors, (0), 0 states 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 19:53:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 178 transitions. [2022-11-02 19:53:29,107 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 178 transitions. Word has length 25 [2022-11-02 19:53:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:29,107 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 178 transitions. [2022-11-02 19:53:29,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 0 states have call successors, (0), 0 states 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 19:53:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 178 transitions. [2022-11-02 19:53:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 19:53:29,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:29,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:29,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:29,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 19:53:29,327 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:29,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:29,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1963988258, now seen corresponding path program 1 times [2022-11-02 19:53:29,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:29,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524673756] [2022-11-02 19:53:29,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:29,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:29,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:29,466 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 19:53:29,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:29,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524673756] [2022-11-02 19:53:29,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524673756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:29,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:29,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:53:29,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467642656] [2022-11-02 19:53:29,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:29,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:53:29,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:29,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:53:29,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:29,469 INFO L87 Difference]: Start difference. First operand 165 states and 178 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 19:53:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:29,640 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2022-11-02 19:53:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:53:29,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2022-11-02 19:53:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:29,642 INFO L225 Difference]: With dead ends: 169 [2022-11-02 19:53:29,642 INFO L226 Difference]: Without dead ends: 169 [2022-11-02 19:53:29,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:53:29,644 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 25 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:29,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 338 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:53:29,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-02 19:53:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2022-11-02 19:53:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.3565891472868217) internal successors, (175), 163 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:29,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2022-11-02 19:53:29,652 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 25 [2022-11-02 19:53:29,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:29,652 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2022-11-02 19:53:29,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states 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 19:53:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2022-11-02 19:53:29,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 19:53:29,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:29,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:29,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 19:53:29,658 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:29,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1375479745, now seen corresponding path program 1 times [2022-11-02 19:53:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:29,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959072724] [2022-11-02 19:53:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:29,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959072724] [2022-11-02 19:53:29,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959072724] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:29,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:29,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:53:29,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939054830] [2022-11-02 19:53:29,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:29,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:53:29,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:53:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:53:29,820 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:29,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:29,928 INFO L93 Difference]: Finished difference Result 166 states and 176 transitions. [2022-11-02 19:53:29,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:53:29,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 19:53:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:29,929 INFO L225 Difference]: With dead ends: 166 [2022-11-02 19:53:29,929 INFO L226 Difference]: Without dead ends: 166 [2022-11-02 19:53:29,930 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 19:53:29,930 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 20 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:29,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 288 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:53:29,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-02 19:53:29,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2022-11-02 19:53:29,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.34375) internal successors, (172), 161 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 19:53:29,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2022-11-02 19:53:29,935 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 26 [2022-11-02 19:53:29,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:29,935 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2022-11-02 19:53:29,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:29,935 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2022-11-02 19:53:29,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 19:53:29,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:29,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:29,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 19:53:29,936 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:29,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:29,937 INFO L85 PathProgramCache]: Analyzing trace with hash -752171090, now seen corresponding path program 1 times [2022-11-02 19:53:29,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:29,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748953785] [2022-11-02 19:53:29,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:29,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:30,087 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 19:53:30,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:30,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748953785] [2022-11-02 19:53:30,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748953785] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:30,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:30,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:53:30,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604206323] [2022-11-02 19:53:30,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:30,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:53:30,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:30,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:53:30,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:30,090 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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 19:53:30,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:30,259 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2022-11-02 19:53:30,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:53:30,260 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 19:53:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:30,262 INFO L225 Difference]: With dead ends: 161 [2022-11-02 19:53:30,262 INFO L226 Difference]: Without dead ends: 161 [2022-11-02 19:53:30,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:30,263 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 6 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:30,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 317 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:53:30,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-11-02 19:53:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-11-02 19:53:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 128 states have (on average 1.3359375) internal successors, (171), 160 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 19:53:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2022-11-02 19:53:30,269 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 28 [2022-11-02 19:53:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:30,269 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2022-11-02 19:53:30,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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 19:53:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2022-11-02 19:53:30,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 19:53:30,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:30,273 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:30,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 19:53:30,273 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:30,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:30,274 INFO L85 PathProgramCache]: Analyzing trace with hash -752171089, now seen corresponding path program 1 times [2022-11-02 19:53:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:30,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918246740] [2022-11-02 19:53:30,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:30,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:30,639 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 19:53:30,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:30,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918246740] [2022-11-02 19:53:30,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918246740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:30,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:30,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:53:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539504009] [2022-11-02 19:53:30,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:30,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:53:30,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:30,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:53:30,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:30,642 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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 19:53:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:30,843 INFO L93 Difference]: Finished difference Result 160 states and 170 transitions. [2022-11-02 19:53:30,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:53:30,844 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 19:53:30,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:30,844 INFO L225 Difference]: With dead ends: 160 [2022-11-02 19:53:30,844 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 19:53:30,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:30,845 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:30,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 307 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:53:30,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 19:53:30,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-02 19:53:30,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 128 states have (on average 1.328125) internal successors, (170), 159 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:30,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 170 transitions. [2022-11-02 19:53:30,849 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 170 transitions. Word has length 28 [2022-11-02 19:53:30,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:30,849 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 170 transitions. [2022-11-02 19:53:30,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 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 19:53:30,850 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 170 transitions. [2022-11-02 19:53:30,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 19:53:30,850 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:30,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:30,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 19:53:30,851 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:30,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1361877815, now seen corresponding path program 1 times [2022-11-02 19:53:30,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:30,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025112855] [2022-11-02 19:53:30,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:30,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:31,109 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 19:53:31,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:31,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025112855] [2022-11-02 19:53:31,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025112855] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:31,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:31,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:53:31,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86432767] [2022-11-02 19:53:31,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:31,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:53:31,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:31,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:53:31,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:53:31,111 INFO L87 Difference]: Start difference. First operand 160 states and 170 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:31,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:31,248 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2022-11-02 19:53:31,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:53:31,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 19:53:31,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:31,250 INFO L225 Difference]: With dead ends: 159 [2022-11-02 19:53:31,250 INFO L226 Difference]: Without dead ends: 159 [2022-11-02 19:53:31,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:31,251 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 15 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:31,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 248 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:53:31,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-02 19:53:31,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2022-11-02 19:53:31,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.31496062992126) internal successors, (167), 157 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:31,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2022-11-02 19:53:31,254 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 29 [2022-11-02 19:53:31,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:31,254 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2022-11-02 19:53:31,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2022-11-02 19:53:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 19:53:31,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:31,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:31,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 19:53:31,255 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:31,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1200575117, now seen corresponding path program 1 times [2022-11-02 19:53:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:31,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936650666] [2022-11-02 19:53:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:31,658 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 19:53:31,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:31,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936650666] [2022-11-02 19:53:31,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936650666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:31,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:31,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 19:53:31,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019863945] [2022-11-02 19:53:31,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:31,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 19:53:31,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:31,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 19:53:31,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 19:53:31,662 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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 19:53:32,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:32,409 INFO L93 Difference]: Finished difference Result 200 states and 209 transitions. [2022-11-02 19:53:32,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 19:53:32,410 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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 31 [2022-11-02 19:53:32,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:32,411 INFO L225 Difference]: With dead ends: 200 [2022-11-02 19:53:32,411 INFO L226 Difference]: Without dead ends: 200 [2022-11-02 19:53:32,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=498, Unknown=0, NotChecked=0, Total=702 [2022-11-02 19:53:32,412 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 268 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:32,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 340 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:53:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-02 19:53:32,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 158. [2022-11-02 19:53:32,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.3070866141732282) internal successors, (166), 157 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:32,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2022-11-02 19:53:32,416 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 31 [2022-11-02 19:53:32,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:32,416 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2022-11-02 19:53:32,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 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 19:53:32,417 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2022-11-02 19:53:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 19:53:32,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:32,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:32,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 19:53:32,418 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:32,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:32,419 INFO L85 PathProgramCache]: Analyzing trace with hash -2047381958, now seen corresponding path program 1 times [2022-11-02 19:53:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:32,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403865152] [2022-11-02 19:53:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:32,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:32,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:32,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403865152] [2022-11-02 19:53:32,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403865152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:53:32,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197783105] [2022-11-02 19:53:32,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:32,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:53:32,586 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:53:32,587 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:53:32,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 19:53:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:32,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 19:53:32,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:32,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:53:32,812 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:32,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197783105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:32,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:53:32,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2022-11-02 19:53:32,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923520153] [2022-11-02 19:53:32,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:32,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:32,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:32,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:32,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:53:32,813 INFO L87 Difference]: Start difference. First operand 158 states and 166 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 19:53:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:32,853 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2022-11-02 19:53:32,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:32,854 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 31 [2022-11-02 19:53:32,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:32,854 INFO L225 Difference]: With dead ends: 160 [2022-11-02 19:53:32,854 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 19:53:32,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:53:32,855 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 72 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:32,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 121 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 19:53:32,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 19:53:32,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-02 19:53:32,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 129 states have (on average 1.302325581395349) internal successors, (168), 159 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:32,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 168 transitions. [2022-11-02 19:53:32,859 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 168 transitions. Word has length 31 [2022-11-02 19:53:32,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:32,859 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 168 transitions. [2022-11-02 19:53:32,859 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 19:53:32,859 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 168 transitions. [2022-11-02 19:53:32,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 19:53:32,860 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:32,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:32,910 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:33,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:53:33,060 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:33,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:33,061 INFO L85 PathProgramCache]: Analyzing trace with hash 739766256, now seen corresponding path program 1 times [2022-11-02 19:53:33,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:33,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516355802] [2022-11-02 19:53:33,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:33,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:33,385 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 19:53:33,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:33,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516355802] [2022-11-02 19:53:33,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516355802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:33,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:33,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:53:33,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419793035] [2022-11-02 19:53:33,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:33,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:53:33,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:33,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:53:33,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:53:33,390 INFO L87 Difference]: Start difference. First operand 160 states and 168 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 19:53:33,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:33,650 INFO L93 Difference]: Finished difference Result 160 states and 168 transitions. [2022-11-02 19:53:33,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 19:53:33,651 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 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 19:53:33,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:33,652 INFO L225 Difference]: With dead ends: 160 [2022-11-02 19:53:33,652 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 19:53:33,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-11-02 19:53:33,653 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 61 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:33,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 268 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:53:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 19:53:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-11-02 19:53:33,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 129 states have (on average 1.2945736434108528) internal successors, (167), 158 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 167 transitions. [2022-11-02 19:53:33,656 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 167 transitions. Word has length 32 [2022-11-02 19:53:33,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:33,656 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 167 transitions. [2022-11-02 19:53:33,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 19:53:33,657 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 167 transitions. [2022-11-02 19:53:33,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 19:53:33,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:33,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:33,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 19:53:33,659 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:33,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash 739766257, now seen corresponding path program 1 times [2022-11-02 19:53:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:33,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418867649] [2022-11-02 19:53:33,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:33,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:33,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:34,171 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 19:53:34,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:34,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418867649] [2022-11-02 19:53:34,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418867649] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:34,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:34,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:53:34,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579190052] [2022-11-02 19:53:34,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:34,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:53:34,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:34,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:53:34,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:53:34,174 INFO L87 Difference]: Start difference. First operand 159 states and 167 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 19:53:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:34,606 INFO L93 Difference]: Finished difference Result 155 states and 163 transitions. [2022-11-02 19:53:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:53:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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 19:53:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:34,607 INFO L225 Difference]: With dead ends: 155 [2022-11-02 19:53:34,607 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 19:53:34,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2022-11-02 19:53:34,609 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 73 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:34,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 409 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:53:34,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 19:53:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 143. [2022-11-02 19:53:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.25) internal successors, (150), 142 states have internal predecessors, (150), 0 states have call successors, (0), 0 states 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 19:53:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 150 transitions. [2022-11-02 19:53:34,613 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 150 transitions. Word has length 32 [2022-11-02 19:53:34,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:34,613 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 150 transitions. [2022-11-02 19:53:34,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states 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 19:53:34,613 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 150 transitions. [2022-11-02 19:53:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 19:53:34,614 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:34,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:34,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 19:53:34,615 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:34,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:34,615 INFO L85 PathProgramCache]: Analyzing trace with hash -439030339, now seen corresponding path program 1 times [2022-11-02 19:53:34,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:34,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419344377] [2022-11-02 19:53:34,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:34,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:34,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:34,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419344377] [2022-11-02 19:53:34,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419344377] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:53:34,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990950391] [2022-11-02 19:53:34,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:34,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:53:34,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:53:34,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:53:34,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 19:53:34,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:34,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 19:53:34,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:34,941 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 19:53:34,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 19:53:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:53:35,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:35,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990950391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:35,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 19:53:35,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-11-02 19:53:35,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558839555] [2022-11-02 19:53:35,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:35,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:53:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:53:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:53:35,005 INFO L87 Difference]: Start difference. First operand 143 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 19:53:35,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:35,094 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-11-02 19:53:35,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:53:35,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 19:53:35,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:35,095 INFO L225 Difference]: With dead ends: 152 [2022-11-02 19:53:35,096 INFO L226 Difference]: Without dead ends: 152 [2022-11-02 19:53:35,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:53:35,097 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:35,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 266 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:53:35,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-02 19:53:35,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 146. [2022-11-02 19:53:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 123 states have (on average 1.2439024390243902) internal successors, (153), 145 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 153 transitions. [2022-11-02 19:53:35,102 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 153 transitions. Word has length 33 [2022-11-02 19:53:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:35,102 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 153 transitions. [2022-11-02 19:53:35,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states 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 19:53:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 153 transitions. [2022-11-02 19:53:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 19:53:35,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:35,103 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] [2022-11-02 19:53:35,137 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-02 19:53:35,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 19:53:35,319 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:35,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:35,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1958129913, now seen corresponding path program 1 times [2022-11-02 19:53:35,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:35,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597582277] [2022-11-02 19:53:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:35,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:35,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:35,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 19:53:35,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597582277] [2022-11-02 19:53:35,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597582277] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 19:53:35,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846671417] [2022-11-02 19:53:35,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:35,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:53:35,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:53:35,592 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 19:53:35,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 19:53:35,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:35,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 19:53:35,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:35,790 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 19:53:35,796 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 19:53:35,829 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 19:53:35,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:53:35,851 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 19:53:35,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:53:36,010 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 19:53:36,026 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 19:53:36,112 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:53:36,112 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:53:36,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:53:36,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846671417] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:53:36,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 19:53:36,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 14 [2022-11-02 19:53:36,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305019035] [2022-11-02 19:53:36,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 19:53:36,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 19:53:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 19:53:36,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 19:53:36,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:53:36,235 INFO L87 Difference]: Start difference. First operand 146 states and 153 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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 19:53:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:36,942 INFO L93 Difference]: Finished difference Result 194 states and 204 transitions. [2022-11-02 19:53:36,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 19:53:36,943 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 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 34 [2022-11-02 19:53:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:36,944 INFO L225 Difference]: With dead ends: 194 [2022-11-02 19:53:36,944 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 19:53:36,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:53:36,945 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 264 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:36,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 520 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:53:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 19:53:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 157. [2022-11-02 19:53:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.2388059701492538) internal successors, (166), 156 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:36,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 166 transitions. [2022-11-02 19:53:36,950 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 166 transitions. Word has length 34 [2022-11-02 19:53:36,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:36,951 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 166 transitions. [2022-11-02 19:53:36,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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 19:53:36,951 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 166 transitions. [2022-11-02 19:53:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 19:53:36,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:36,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:36,993 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:37,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 19:53:37,152 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:37,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:37,153 INFO L85 PathProgramCache]: Analyzing trace with hash 572484811, now seen corresponding path program 1 times [2022-11-02 19:53:37,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 19:53:37,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443603334] [2022-11-02 19:53:37,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:37,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 19:53:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:53:37,185 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 19:53:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:53:37,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-02 19:53:37,228 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 19:53:37,229 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2022-11-02 19:53:37,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2022-11-02 19:53:37,231 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2022-11-02 19:53:37,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2022-11-02 19:53:37,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2022-11-02 19:53:37,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2022-11-02 19:53:37,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2022-11-02 19:53:37,232 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2022-11-02 19:53:37,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2022-11-02 19:53:37,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2022-11-02 19:53:37,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2022-11-02 19:53:37,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2022-11-02 19:53:37,233 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2022-11-02 19:53:37,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2022-11-02 19:53:37,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2022-11-02 19:53:37,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2022-11-02 19:53:37,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2022-11-02 19:53:37,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2022-11-02 19:53:37,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2022-11-02 19:53:37,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2022-11-02 19:53:37,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2022-11-02 19:53:37,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2022-11-02 19:53:37,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2022-11-02 19:53:37,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2022-11-02 19:53:37,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2022-11-02 19:53:37,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2022-11-02 19:53:37,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2022-11-02 19:53:37,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2022-11-02 19:53:37,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2022-11-02 19:53:37,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2022-11-02 19:53:37,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2022-11-02 19:53:37,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2022-11-02 19:53:37,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2022-11-02 19:53:37,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2022-11-02 19:53:37,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2022-11-02 19:53:37,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2022-11-02 19:53:37,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2022-11-02 19:53:37,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2022-11-02 19:53:37,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2022-11-02 19:53:37,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2022-11-02 19:53:37,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2022-11-02 19:53:37,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (35 of 77 remaining) [2022-11-02 19:53:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2022-11-02 19:53:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 77 remaining) [2022-11-02 19:53:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (32 of 77 remaining) [2022-11-02 19:53:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (31 of 77 remaining) [2022-11-02 19:53:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (30 of 77 remaining) [2022-11-02 19:53:37,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2022-11-02 19:53:37,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2022-11-02 19:53:37,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (27 of 77 remaining) [2022-11-02 19:53:37,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2022-11-02 19:53:37,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2022-11-02 19:53:37,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2022-11-02 19:53:37,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2022-11-02 19:53:37,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (22 of 77 remaining) [2022-11-02 19:53:37,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2022-11-02 19:53:37,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2022-11-02 19:53:37,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (19 of 77 remaining) [2022-11-02 19:53:37,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2022-11-02 19:53:37,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2022-11-02 19:53:37,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2022-11-02 19:53:37,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2022-11-02 19:53:37,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2022-11-02 19:53:37,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2022-11-02 19:53:37,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (12 of 77 remaining) [2022-11-02 19:53:37,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (11 of 77 remaining) [2022-11-02 19:53:37,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (10 of 77 remaining) [2022-11-02 19:53:37,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2022-11-02 19:53:37,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2022-11-02 19:53:37,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (7 of 77 remaining) [2022-11-02 19:53:37,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (6 of 77 remaining) [2022-11-02 19:53:37,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (5 of 77 remaining) [2022-11-02 19:53:37,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2022-11-02 19:53:37,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2022-11-02 19:53:37,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (2 of 77 remaining) [2022-11-02 19:53:37,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE (1 of 77 remaining) [2022-11-02 19:53:37,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (0 of 77 remaining) [2022-11-02 19:53:37,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 19:53:37,257 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:37,261 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 19:53:37,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:53:37 BoogieIcfgContainer [2022-11-02 19:53:37,312 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 19:53:37,318 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 19:53:37,318 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 19:53:37,318 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 19:53:37,319 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:53:20" (3/4) ... [2022-11-02 19:53:37,322 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 19:53:37,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 19:53:37,323 INFO L158 Benchmark]: Toolchain (without parser) took 18428.51ms. Allocated memory was 134.2MB in the beginning and 325.1MB in the end (delta: 190.8MB). Free memory was 97.6MB in the beginning and 150.8MB in the end (delta: -53.3MB). Peak memory consumption was 136.5MB. Max. memory is 16.1GB. [2022-11-02 19:53:37,323 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 134.2MB. Free memory was 115.0MB in the beginning and 114.9MB in the end (delta: 165.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:53:37,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 663.42ms. Allocated memory is still 134.2MB. Free memory was 97.4MB in the beginning and 100.5MB in the end (delta: -3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-02 19:53:37,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.33ms. Allocated memory is still 134.2MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 19:53:37,325 INFO L158 Benchmark]: Boogie Preprocessor took 75.18ms. Allocated memory is still 134.2MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 19:53:37,325 INFO L158 Benchmark]: RCFGBuilder took 887.73ms. Allocated memory is still 134.2MB. Free memory was 96.5MB in the beginning and 70.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-02 19:53:37,326 INFO L158 Benchmark]: TraceAbstraction took 16708.55ms. Allocated memory was 134.2MB in the beginning and 325.1MB in the end (delta: 190.8MB). Free memory was 69.8MB in the beginning and 150.8MB in the end (delta: -81.1MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. [2022-11-02 19:53:37,326 INFO L158 Benchmark]: Witness Printer took 4.81ms. Allocated memory is still 325.1MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:53:37,336 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 134.2MB. Free memory was 115.0MB in the beginning and 114.9MB in the end (delta: 165.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 663.42ms. Allocated memory is still 134.2MB. Free memory was 97.4MB in the beginning and 100.5MB in the end (delta: -3.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.33ms. Allocated memory is still 134.2MB. Free memory was 100.5MB in the beginning and 98.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.18ms. Allocated memory is still 134.2MB. Free memory was 98.6MB in the beginning and 96.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 887.73ms. Allocated memory is still 134.2MB. Free memory was 96.5MB in the beginning and 70.3MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16708.55ms. Allocated memory was 134.2MB in the beginning and 325.1MB in the end (delta: 190.8MB). Free memory was 69.8MB in the beginning and 150.8MB in the end (delta: -81.1MB). Peak memory consumption was 111.8MB. Max. memory is 16.1GB. * Witness Printer took 4.81ms. Allocated memory is still 325.1MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={-1:0}] [L1000] null->prev = ((void*)0) VAL [null={-1:0}] [L1001] null->colour = BLACK VAL [null={-1:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={-2:0}, null={-1:0}] [L1005] list->prev = null VAL [list={-2:0}, null={-1:0}] [L1006] list->colour = BLACK VAL [list={-2:0}, null={-1:0}] [L1008] struct TSLL* end = list; VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1042] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={-2:0}, list={-2:0}, null={-1:0}] [L1045] EXPR end->colour VAL [end={-2:0}, end->colour=1, list={-2:0}, null={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={-2:0}, end->next={-1:0}, list={-2:0}, null={-1:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1056] COND TRUE null != list VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1058] EXPR list->colour VAL [end={-1:0}, list={-2:0}, list->colour=1, null={-1:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={-1:0}, list={-2:0}, list->next={-1:0}, null={-1:0}] [L1067] end = list->next [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) VAL [end={-1:0}, list={-2:0}, null={-1:0}] [L1068] free(list) [L1069] list = end VAL [end={-1:0}, list={-1:0}, null={-1:0}] [L1056] COND FALSE !(null != list) VAL [end={-1:0}, list={-1:0}, null={-1:0}] [L1073] return 0; VAL [\result=0, end={-1:0}, list={-1:0}, null={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3109 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3109 mSDsluCounter, 6334 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4102 mSDsCounter, 309 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5899 IncrementalHoareTripleChecker+Invalid, 6208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 309 mSolverCounterUnsat, 2232 mSDtfsCounter, 5899 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 396 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=0, InterpolantAutomatonStates: 173, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 348 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 657 ConstructedInterpolants, 0 QuantifiedInterpolants, 4374 SizeOfPredicates, 15 NumberOfNonLiveVariables, 840 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 10/19 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 19:53:37,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/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_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/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 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 19:53:39,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 19:53:39,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 19:53:39,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 19:53:39,789 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 19:53:39,793 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 19:53:39,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 19:53:39,802 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 19:53:39,807 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 19:53:39,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 19:53:39,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 19:53:39,814 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 19:53:39,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 19:53:39,819 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 19:53:39,820 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 19:53:39,822 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 19:53:39,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 19:53:39,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 19:53:39,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 19:53:39,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 19:53:39,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 19:53:39,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 19:53:39,839 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 19:53:39,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 19:53:39,843 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 19:53:39,843 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 19:53:39,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 19:53:39,845 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 19:53:39,845 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 19:53:39,846 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 19:53:39,846 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 19:53:39,847 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 19:53:39,848 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 19:53:39,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 19:53:39,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 19:53:39,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 19:53:39,851 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 19:53:39,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 19:53:39,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 19:53:39,852 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 19:53:39,853 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 19:53:39,854 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-02 19:53:39,901 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 19:53:39,903 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 19:53:39,904 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 19:53:39,905 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 19:53:39,906 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 19:53:39,906 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 19:53:39,907 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 19:53:39,907 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 19:53:39,908 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 19:53:39,908 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 19:53:39,909 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 19:53:39,909 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 19:53:39,909 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 19:53:39,909 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 19:53:39,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 19:53:39,910 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 19:53:39,910 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 19:53:39,910 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 19:53:39,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 19:53:39,911 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 19:53:39,911 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-02 19:53:39,911 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-02 19:53:39,911 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 19:53:39,912 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 19:53:39,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 19:53:39,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 19:53:39,913 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 19:53:39,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:53:39,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 19:53:39,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 19:53:39,914 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-02 19:53:39,914 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-02 19:53:39,914 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-02 19:53:39,914 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/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_a3053fa4-590b-42aa-907f-bf088a9d23da/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 -> 503e46fe74670dc8b1fd2e8b2c5a408fc01c83cb421ff9aefb8796417315d291 [2022-11-02 19:53:40,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 19:53:40,325 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 19:53:40,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 19:53:40,332 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 19:53:40,334 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 19:53:40,336 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2022-11-02 19:53:40,405 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data/59850b50f/b66f9c069af943e9a7da8f0513ddc726/FLAGa319db78b [2022-11-02 19:53:40,986 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 19:53:40,987 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i [2022-11-02 19:53:41,003 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data/59850b50f/b66f9c069af943e9a7da8f0513ddc726/FLAGa319db78b [2022-11-02 19:53:41,255 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/data/59850b50f/b66f9c069af943e9a7da8f0513ddc726 [2022-11-02 19:53:41,257 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 19:53:41,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 19:53:41,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 19:53:41,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 19:53:41,267 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 19:53:41,268 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,269 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b735aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41, skipping insertion in model container [2022-11-02 19:53:41,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,277 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 19:53:41,308 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 19:53:41,692 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-11-02 19:53:41,697 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-11-02 19:53:41,697 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-11-02 19:53:41,701 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-11-02 19:53:41,703 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-11-02 19:53:41,706 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-11-02 19:53:41,708 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-11-02 19:53:41,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:53:41,737 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 19:53:41,809 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22665,22678] [2022-11-02 19:53:41,810 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22735,22748] [2022-11-02 19:53:41,810 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22799,22812] [2022-11-02 19:53:41,811 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22894,22907] [2022-11-02 19:53:41,812 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[22966,22979] [2022-11-02 19:53:41,813 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23105,23118] [2022-11-02 19:53:41,813 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_a3053fa4-590b-42aa-907f-bf088a9d23da/sv-benchmarks/c/forester-heap/dll-rb-sentinel-1.i[23179,23192] [2022-11-02 19:53:41,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 19:53:41,843 INFO L208 MainTranslator]: Completed translation [2022-11-02 19:53:41,844 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41 WrapperNode [2022-11-02 19:53:41,844 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 19:53:41,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 19:53:41,845 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 19:53:41,845 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 19:53:41,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,868 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,892 INFO L138 Inliner]: procedures = 122, calls = 43, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 164 [2022-11-02 19:53:41,893 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 19:53:41,894 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 19:53:41,894 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 19:53:41,894 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 19:53:41,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,908 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,908 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,917 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,939 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 19:53:41,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 19:53:41,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 19:53:41,944 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 19:53:41,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (1/1) ... [2022-11-02 19:53:41,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 19:53:41,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 19:53:41,976 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 19:53:41,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 19:53:42,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-02 19:53:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 19:53:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 19:53:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 19:53:42,020 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 19:53:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 19:53:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-02 19:53:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-02 19:53:42,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 19:53:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 19:53:42,190 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 19:53:42,193 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 19:53:43,006 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 19:53:43,012 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 19:53:43,013 INFO L300 CfgBuilder]: Removed 17 assume(true) statements. [2022-11-02 19:53:43,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:53:43 BoogieIcfgContainer [2022-11-02 19:53:43,015 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 19:53:43,018 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 19:53:43,018 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 19:53:43,022 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 19:53:43,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 07:53:41" (1/3) ... [2022-11-02 19:53:43,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b0cc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:53:43, skipping insertion in model container [2022-11-02 19:53:43,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 07:53:41" (2/3) ... [2022-11-02 19:53:43,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62b0cc5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 07:53:43, skipping insertion in model container [2022-11-02 19:53:43,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:53:43" (3/3) ... [2022-11-02 19:53:43,029 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel-1.i [2022-11-02 19:53:43,063 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 19:53:43,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2022-11-02 19:53:43,112 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 19:53:43,119 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;@5175ed2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 19:53:43,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2022-11-02 19:53:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 86 states have (on average 2.244186046511628) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:43,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 19:53:43,131 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:43,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 19:53:43,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:43,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:43,138 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 19:53:43,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:43,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863789371] [2022-11-02 19:53:43,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:43,156 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:43,156 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:43,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:43,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-02 19:53:43,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:43,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 19:53:43,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:43,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 19:53:43,333 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 19:53:43,333 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:43,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:43,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863789371] [2022-11-02 19:53:43,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863789371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:43,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:43,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:53:43,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152489274] [2022-11-02 19:53:43,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:43,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:43,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:43,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:43,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:43,375 INFO L87 Difference]: Start difference. First operand has 164 states, 86 states have (on average 2.244186046511628) internal successors, (193), 163 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:43,802 INFO L93 Difference]: Finished difference Result 191 states and 197 transitions. [2022-11-02 19:53:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:43,805 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 19:53:43,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:43,815 INFO L225 Difference]: With dead ends: 191 [2022-11-02 19:53:43,815 INFO L226 Difference]: Without dead ends: 187 [2022-11-02 19:53:43,817 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 19:53:43,820 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 149 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:43,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 110 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:53:43,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-11-02 19:53:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 159. [2022-11-02 19:53:43,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 85 states have (on average 1.9294117647058824) internal successors, (164), 158 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 164 transitions. [2022-11-02 19:53:43,863 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 164 transitions. Word has length 3 [2022-11-02 19:53:43,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:43,864 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 164 transitions. [2022-11-02 19:53:43,864 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 19:53:43,865 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 164 transitions. [2022-11-02 19:53:43,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 19:53:43,865 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:43,865 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 19:53:43,877 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-02 19:53:44,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:44,077 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:44,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:44,078 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 19:53:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:44,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1286388003] [2022-11-02 19:53:44,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:44,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:44,079 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:44,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:44,099 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-02 19:53:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:44,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 19:53:44,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:44,166 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 19:53:44,178 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 19:53:44,178 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:44,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:44,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1286388003] [2022-11-02 19:53:44,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1286388003] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:44,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:44,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:53:44,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362549064] [2022-11-02 19:53:44,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:44,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:44,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:44,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:44,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:44,183 INFO L87 Difference]: Start difference. First operand 159 states and 164 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:44,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:44,548 INFO L93 Difference]: Finished difference Result 156 states and 161 transitions. [2022-11-02 19:53:44,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:44,549 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 19:53:44,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:44,551 INFO L225 Difference]: With dead ends: 156 [2022-11-02 19:53:44,551 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 19:53:44,551 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 19:53:44,552 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:44,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 89 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:53:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 19:53:44,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-11-02 19:53:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 85 states have (on average 1.8941176470588235) internal successors, (161), 155 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:44,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 161 transitions. [2022-11-02 19:53:44,576 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 161 transitions. Word has length 3 [2022-11-02 19:53:44,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:44,577 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 161 transitions. [2022-11-02 19:53:44,577 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 19:53:44,578 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 161 transitions. [2022-11-02 19:53:44,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 19:53:44,579 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:44,579 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:44,600 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:44,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:44,791 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:44,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026981, now seen corresponding path program 1 times [2022-11-02 19:53:44,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:44,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1591373947] [2022-11-02 19:53:44,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:44,796 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:44,796 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:44,801 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:44,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-02 19:53:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:44,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-02 19:53:44,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:44,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 19:53:44,916 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 19:53:44,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:44,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:44,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1591373947] [2022-11-02 19:53:44,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1591373947] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:44,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:44,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:53:44,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865122972] [2022-11-02 19:53:44,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:44,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:44,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:44,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:44,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:44,921 INFO L87 Difference]: Start difference. First operand 156 states and 161 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:45,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:45,298 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2022-11-02 19:53:45,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:45,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 19:53:45,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:45,301 INFO L225 Difference]: With dead ends: 155 [2022-11-02 19:53:45,301 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 19:53:45,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:45,302 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 133 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:45,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 95 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:53:45,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 19:53:45,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-11-02 19:53:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 87 states have (on average 1.8160919540229885) internal successors, (158), 150 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 158 transitions. [2022-11-02 19:53:45,320 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 158 transitions. Word has length 7 [2022-11-02 19:53:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:45,320 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 158 transitions. [2022-11-02 19:53:45,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 158 transitions. [2022-11-02 19:53:45,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-02 19:53:45,321 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:45,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:45,343 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:45,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:45,533 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:45,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1803026982, now seen corresponding path program 1 times [2022-11-02 19:53:45,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:45,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954398033] [2022-11-02 19:53:45,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:45,535 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:45,535 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:45,537 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:45,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-02 19:53:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:45,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-02 19:53:45,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:45,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 19:53:45,654 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 19:53:45,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:45,654 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:45,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954398033] [2022-11-02 19:53:45,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954398033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:45,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:45,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:53:45,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573324716] [2022-11-02 19:53:45,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:45,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:53:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:53:45,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:45,657 INFO L87 Difference]: Start difference. First operand 151 states and 158 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:46,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:46,025 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2022-11-02 19:53:46,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:53:46,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-02 19:53:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:46,027 INFO L225 Difference]: With dead ends: 168 [2022-11-02 19:53:46,027 INFO L226 Difference]: Without dead ends: 168 [2022-11-02 19:53:46,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:53:46,028 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 129 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:46,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 102 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:53:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-02 19:53:46,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2022-11-02 19:53:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 94 states have (on average 1.7234042553191489) internal successors, (162), 154 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:46,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 162 transitions. [2022-11-02 19:53:46,055 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 162 transitions. Word has length 7 [2022-11-02 19:53:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:46,055 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 162 transitions. [2022-11-02 19:53:46,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 162 transitions. [2022-11-02 19:53:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 19:53:46,056 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:46,057 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:46,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:46,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:46,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594255, now seen corresponding path program 1 times [2022-11-02 19:53:46,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:46,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1878742539] [2022-11-02 19:53:46,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:46,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:46,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:46,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:46,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-02 19:53:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:46,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 19:53:46,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:46,416 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 19:53:46,461 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 19:53:46,462 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 19:53:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:46,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:46,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:46,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1878742539] [2022-11-02 19:53:46,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1878742539] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:46,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:46,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:53:46,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102982541] [2022-11-02 19:53:46,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:46,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:53:46,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:46,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:53:46,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:53:46,480 INFO L87 Difference]: Start difference. First operand 155 states and 162 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:46,909 INFO L93 Difference]: Finished difference Result 156 states and 164 transitions. [2022-11-02 19:53:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:53:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 19:53:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:46,911 INFO L225 Difference]: With dead ends: 156 [2022-11-02 19:53:46,911 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 19:53:46,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:46,912 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 211 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:46,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 79 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:53:46,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 19:53:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 142. [2022-11-02 19:53:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 96 states have (on average 1.5729166666666667) internal successors, (151), 141 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:46,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 151 transitions. [2022-11-02 19:53:46,919 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 151 transitions. Word has length 12 [2022-11-02 19:53:46,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:46,920 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 151 transitions. [2022-11-02 19:53:46,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 151 transitions. [2022-11-02 19:53:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 19:53:46,921 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:46,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:46,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:47,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:47,134 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:47,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:47,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1483594254, now seen corresponding path program 1 times [2022-11-02 19:53:47,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:47,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [861152156] [2022-11-02 19:53:47,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:47,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:47,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:47,138 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:47,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-02 19:53:47,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:47,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-02 19:53:47,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:47,298 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 19:53:47,371 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:53:47,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 19:53:47,387 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 19:53:47,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:47,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:47,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [861152156] [2022-11-02 19:53:47,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [861152156] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:47,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:47,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 19:53:47,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952731775] [2022-11-02 19:53:47,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:47,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:53:47,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:47,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:53:47,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:53:47,390 INFO L87 Difference]: Start difference. First operand 142 states and 151 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:47,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:47,972 INFO L93 Difference]: Finished difference Result 180 states and 190 transitions. [2022-11-02 19:53:47,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:53:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 19:53:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:47,973 INFO L225 Difference]: With dead ends: 180 [2022-11-02 19:53:47,974 INFO L226 Difference]: Without dead ends: 180 [2022-11-02 19:53:47,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:47,975 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 175 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:47,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 117 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 19:53:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-02 19:53:47,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 151. [2022-11-02 19:53:47,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 106 states have (on average 1.5377358490566038) internal successors, (163), 150 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:47,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2022-11-02 19:53:47,983 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 12 [2022-11-02 19:53:47,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:47,983 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-11-02 19:53:47,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2022-11-02 19:53:47,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 19:53:47,984 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:47,984 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:48,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:48,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:48,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:48,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:48,203 INFO L85 PathProgramCache]: Analyzing trace with hash 195115107, now seen corresponding path program 1 times [2022-11-02 19:53:48,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:48,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528111978] [2022-11-02 19:53:48,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:48,204 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:48,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:48,205 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:48,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-02 19:53:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:48,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 19:53:48,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:48,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 19:53:48,367 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 19:53:48,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 19:53:48,414 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 19:53:48,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:48,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:48,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528111978] [2022-11-02 19:53:48,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528111978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:48,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:48,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:53:48,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218167943] [2022-11-02 19:53:48,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:48,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:53:48,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:48,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:53:48,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:48,421 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:49,009 INFO L93 Difference]: Finished difference Result 194 states and 203 transitions. [2022-11-02 19:53:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:53:49,009 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 19:53:49,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:49,012 INFO L225 Difference]: With dead ends: 194 [2022-11-02 19:53:49,012 INFO L226 Difference]: Without dead ends: 194 [2022-11-02 19:53:49,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:49,013 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 296 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:49,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 149 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:53:49,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-02 19:53:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 149. [2022-11-02 19:53:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 105 states have (on average 1.5142857142857142) internal successors, (159), 148 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 159 transitions. [2022-11-02 19:53:49,020 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 159 transitions. Word has length 14 [2022-11-02 19:53:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:49,020 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 159 transitions. [2022-11-02 19:53:49,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:49,021 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 159 transitions. [2022-11-02 19:53:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 19:53:49,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:49,022 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:49,046 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:49,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:49,243 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:49,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997431, now seen corresponding path program 1 times [2022-11-02 19:53:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:49,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723323497] [2022-11-02 19:53:49,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:49,245 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:49,250 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-02 19:53:49,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:49,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 19:53:49,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:49,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 19:53:49,406 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 19:53:49,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-02 19:53:49,448 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 19:53:49,448 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:49,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:49,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723323497] [2022-11-02 19:53:49,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723323497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:49,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:49,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:53:49,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710480975] [2022-11-02 19:53:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:49,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:53:49,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:49,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:53:49,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:49,451 INFO L87 Difference]: Start difference. First operand 149 states and 159 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:50,045 INFO L93 Difference]: Finished difference Result 148 states and 157 transitions. [2022-11-02 19:53:50,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:53:50,045 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 19:53:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:50,050 INFO L225 Difference]: With dead ends: 148 [2022-11-02 19:53:50,051 INFO L226 Difference]: Without dead ends: 148 [2022-11-02 19:53:50,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:50,052 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 9 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:50,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 334 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 19:53:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-02 19:53:50,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-02 19:53:50,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 105 states have (on average 1.4952380952380953) internal successors, (157), 147 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:50,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2022-11-02 19:53:50,056 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 15 [2022-11-02 19:53:50,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:50,057 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2022-11-02 19:53:50,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:50,057 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2022-11-02 19:53:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 19:53:50,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:50,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:50,070 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:50,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:50,268 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:50,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:50,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1751997432, now seen corresponding path program 1 times [2022-11-02 19:53:50,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:50,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138635758] [2022-11-02 19:53:50,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:50,269 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:50,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:50,270 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:50,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-02 19:53:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:50,395 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 19:53:50,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:50,407 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 19:53:50,448 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 19:53:50,455 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 19:53:50,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 19:53:50,511 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 19:53:50,526 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 19:53:50,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:50,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:50,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138635758] [2022-11-02 19:53:50,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138635758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:50,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:50,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:53:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887549056] [2022-11-02 19:53:50,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:50,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:53:50,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:50,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:53:50,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:53:50,530 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:51,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:51,192 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2022-11-02 19:53:51,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:53:51,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 19:53:51,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:51,194 INFO L225 Difference]: With dead ends: 147 [2022-11-02 19:53:51,194 INFO L226 Difference]: Without dead ends: 147 [2022-11-02 19:53:51,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:53:51,195 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:51,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 319 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 19:53:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-02 19:53:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2022-11-02 19:53:51,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 105 states have (on average 1.4761904761904763) internal successors, (155), 146 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 155 transitions. [2022-11-02 19:53:51,217 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 155 transitions. Word has length 15 [2022-11-02 19:53:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:51,218 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 155 transitions. [2022-11-02 19:53:51,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2022-11-02 19:53:51,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 19:53:51,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:51,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:51,232 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:51,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:51,430 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:51,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:51,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1587467776, now seen corresponding path program 1 times [2022-11-02 19:53:51,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:51,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320090065] [2022-11-02 19:53:51,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:51,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:51,432 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:51,433 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:51,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-11-02 19:53:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:51,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 19:53:51,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:51,593 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 19:53:51,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 19:53:51,686 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 19:53:51,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:51,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:51,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320090065] [2022-11-02 19:53:51,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320090065] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:51,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:51,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:53:51,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716622103] [2022-11-02 19:53:51,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:51,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:53:51,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:51,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:53:51,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:53:51,689 INFO L87 Difference]: Start difference. First operand 147 states and 155 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:52,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:52,277 INFO L93 Difference]: Finished difference Result 201 states and 213 transitions. [2022-11-02 19:53:52,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:53:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 19:53:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:52,279 INFO L225 Difference]: With dead ends: 201 [2022-11-02 19:53:52,279 INFO L226 Difference]: Without dead ends: 201 [2022-11-02 19:53:52,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:53:52,280 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 232 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:52,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 347 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:53:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-02 19:53:52,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2022-11-02 19:53:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.4545454545454546) internal successors, (160), 151 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:52,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 160 transitions. [2022-11-02 19:53:52,285 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 160 transitions. Word has length 17 [2022-11-02 19:53:52,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:52,286 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 160 transitions. [2022-11-02 19:53:52,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:52,286 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 160 transitions. [2022-11-02 19:53:52,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 19:53:52,287 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:52,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:52,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:52,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:52,499 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:52,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128633, now seen corresponding path program 1 times [2022-11-02 19:53:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:52,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342934148] [2022-11-02 19:53:52,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:52,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:52,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:52,501 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:52,507 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-11-02 19:53:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:52,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 19:53:52,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:52,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 19:53:52,771 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 19:53:52,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 19:53:52,807 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 19:53:52,915 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:53:52,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 19:53:52,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-02 19:53:53,015 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 19:53:53,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:53,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:53,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342934148] [2022-11-02 19:53:53,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342934148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:53,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:53,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:53:53,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699852370] [2022-11-02 19:53:53,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:53,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:53:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:53,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:53:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:53:53,017 INFO L87 Difference]: Start difference. First operand 152 states and 160 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:54,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:54,112 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2022-11-02 19:53:54,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 19:53:54,113 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 19:53:54,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:54,114 INFO L225 Difference]: With dead ends: 183 [2022-11-02 19:53:54,114 INFO L226 Difference]: Without dead ends: 183 [2022-11-02 19:53:54,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-11-02 19:53:54,116 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 151 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:54,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 312 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 327 Invalid, 0 Unknown, 109 Unchecked, 0.8s Time] [2022-11-02 19:53:54,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-11-02 19:53:54,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 151. [2022-11-02 19:53:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 110 states have (on average 1.4454545454545455) internal successors, (159), 150 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:54,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 159 transitions. [2022-11-02 19:53:54,120 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 159 transitions. Word has length 19 [2022-11-02 19:53:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:54,120 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 159 transitions. [2022-11-02 19:53:54,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 159 transitions. [2022-11-02 19:53:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-02 19:53:54,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:54,121 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:54,151 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:54,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:54,343 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:54,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:54,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2045128634, now seen corresponding path program 1 times [2022-11-02 19:53:54,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:54,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627283777] [2022-11-02 19:53:54,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:54,345 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:54,346 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:54,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-11-02 19:53:54,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:54,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 19:53:54,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:54,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 19:53:54,613 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 19:53:54,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 19:53:54,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 19:53:54,658 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 19:53:54,670 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 19:53:54,764 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:53:54,765 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 19:53:54,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 19:53:54,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 19:53:54,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 19:53:54,870 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 19:53:54,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:54,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:54,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627283777] [2022-11-02 19:53:54,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627283777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:54,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:54,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 19:53:54,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007829321] [2022-11-02 19:53:54,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:54,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 19:53:54,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:54,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 19:53:54,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 19:53:54,872 INFO L87 Difference]: Start difference. First operand 151 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:56,578 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2022-11-02 19:53:56,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 19:53:56,579 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-02 19:53:56,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:56,580 INFO L225 Difference]: With dead ends: 168 [2022-11-02 19:53:56,580 INFO L226 Difference]: Without dead ends: 168 [2022-11-02 19:53:56,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-11-02 19:53:56,581 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 226 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:56,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 300 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 19:53:56,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-02 19:53:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2022-11-02 19:53:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 119 states have (on average 1.3949579831932772) internal successors, (166), 153 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2022-11-02 19:53:56,585 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 19 [2022-11-02 19:53:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:56,586 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2022-11-02 19:53:56,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2022-11-02 19:53:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 19:53:56,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:56,587 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:56,598 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:56,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:56,790 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:56,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1915505871, now seen corresponding path program 1 times [2022-11-02 19:53:56,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:56,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1985411418] [2022-11-02 19:53:56,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:56,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:56,792 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:56,793 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:56,815 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-11-02 19:53:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:56,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 19:53:56,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:56,995 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 19:53:57,002 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 19:53:57,035 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 19:53:57,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:53:57,066 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 19:53:57,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:53:57,231 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 19:53:57,235 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 19:53:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:57,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:53:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:53:57,479 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:57,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1985411418] [2022-11-02 19:53:57,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1985411418] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:53:57,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 19:53:57,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2022-11-02 19:53:57,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788313309] [2022-11-02 19:53:57,480 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 19:53:57,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 19:53:57,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:57,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 19:53:57,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-02 19:53:57,481 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 19:53:58,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:58,844 INFO L93 Difference]: Finished difference Result 205 states and 221 transitions. [2022-11-02 19:53:58,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:53:58,845 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 19:53:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:58,846 INFO L225 Difference]: With dead ends: 205 [2022-11-02 19:53:58,846 INFO L226 Difference]: Without dead ends: 205 [2022-11-02 19:53:58,847 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-11-02 19:53:58,847 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 202 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:58,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 467 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 19:53:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-02 19:53:58,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 161. [2022-11-02 19:53:58,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.380952380952381) internal successors, (174), 160 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:58,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2022-11-02 19:53:58,852 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 24 [2022-11-02 19:53:58,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:58,852 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2022-11-02 19:53:58,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 0 states have call successors, (0), 0 states 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 19:53:58,852 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2022-11-02 19:53:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 19:53:58,853 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:58,853 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:58,866 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-11-02 19:53:59,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:53:59,062 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:53:59,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:53:59,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1957524124, now seen corresponding path program 1 times [2022-11-02 19:53:59,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:53:59,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745344471] [2022-11-02 19:53:59,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:53:59,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:53:59,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:53:59,064 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:53:59,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-11-02 19:53:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:53:59,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 19:53:59,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:53:59,214 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 19:53:59,297 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 19:53:59,310 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 19:53:59,310 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:53:59,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:53:59,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745344471] [2022-11-02 19:53:59,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745344471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:53:59,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:53:59,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 19:53:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679876983] [2022-11-02 19:53:59,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:53:59,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 19:53:59,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:53:59,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 19:53:59,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:53:59,312 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:53:59,902 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2022-11-02 19:53:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:53:59,902 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 19:53:59,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:53:59,904 INFO L225 Difference]: With dead ends: 184 [2022-11-02 19:53:59,904 INFO L226 Difference]: Without dead ends: 184 [2022-11-02 19:53:59,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:53:59,905 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 136 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:53:59,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 341 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:53:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-02 19:53:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 161. [2022-11-02 19:53:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 126 states have (on average 1.373015873015873) internal successors, (173), 160 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:59,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2022-11-02 19:53:59,914 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 24 [2022-11-02 19:53:59,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:53:59,915 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2022-11-02 19:53:59,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:53:59,915 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2022-11-02 19:53:59,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 19:53:59,917 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:53:59,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:53:59,930 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:00,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:00,131 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:00,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:00,131 INFO L85 PathProgramCache]: Analyzing trace with hash 915476318, now seen corresponding path program 1 times [2022-11-02 19:54:00,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:00,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1107423624] [2022-11-02 19:54:00,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:00,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:00,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:00,133 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:00,136 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-11-02 19:54:00,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:00,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 19:54:00,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:00,317 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 19:54:00,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 19:54:00,342 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 19:54:00,342 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:54:00,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:00,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1107423624] [2022-11-02 19:54:00,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1107423624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:00,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:00,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:54:00,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264597588] [2022-11-02 19:54:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:00,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:54:00,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:00,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:54:00,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:54:00,345 INFO L87 Difference]: Start difference. First operand 161 states and 173 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:00,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:00,636 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2022-11-02 19:54:00,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:54:00,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-02 19:54:00,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:00,637 INFO L225 Difference]: With dead ends: 163 [2022-11-02 19:54:00,637 INFO L226 Difference]: Without dead ends: 163 [2022-11-02 19:54:00,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:54:00,638 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 19 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:00,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 280 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 19:54:00,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-11-02 19:54:00,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2022-11-02 19:54:00,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 125 states have (on average 1.36) internal successors, (170), 158 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:00,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 170 transitions. [2022-11-02 19:54:00,643 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 170 transitions. Word has length 24 [2022-11-02 19:54:00,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:00,643 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 170 transitions. [2022-11-02 19:54:00,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:00,643 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 170 transitions. [2022-11-02 19:54:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 19:54:00,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:00,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:00,658 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-11-02 19:54:00,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:00,857 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:00,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:00,857 INFO L85 PathProgramCache]: Analyzing trace with hash -433833013, now seen corresponding path program 1 times [2022-11-02 19:54:00,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:00,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569078875] [2022-11-02 19:54:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:00,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:00,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:00,860 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:00,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-11-02 19:54:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:01,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-02 19:54:01,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:01,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 19:54:01,067 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 19:54:01,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-02 19:54:01,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:54:01,093 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:54:01,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:01,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569078875] [2022-11-02 19:54:01,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569078875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:01,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:01,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:54:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029297233] [2022-11-02 19:54:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:01,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:54:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:01,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:54:01,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:54:01,096 INFO L87 Difference]: Start difference. First operand 159 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:01,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:01,607 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2022-11-02 19:54:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 19:54:01,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 19:54:01,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:01,609 INFO L225 Difference]: With dead ends: 158 [2022-11-02 19:54:01,609 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 19:54:01,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:54:01,610 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 6 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:01,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 309 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:54:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 19:54:01,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-11-02 19:54:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 125 states have (on average 1.352) internal successors, (169), 157 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2022-11-02 19:54:01,615 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 26 [2022-11-02 19:54:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:01,615 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2022-11-02 19:54:01,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2022-11-02 19:54:01,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 19:54:01,616 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:01,616 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:01,634 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:01,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:01,830 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash -433833012, now seen corresponding path program 1 times [2022-11-02 19:54:01,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:01,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780852126] [2022-11-02 19:54:01,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:01,830 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:01,831 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:01,831 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:01,833 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-11-02 19:54:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:02,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 19:54:02,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:02,041 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 19:54:02,063 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 19:54:02,069 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 19:54:02,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 19:54:02,101 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 19:54:02,124 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 19:54:02,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:54:02,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:02,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780852126] [2022-11-02 19:54:02,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780852126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:02,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:02,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:54:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377647364] [2022-11-02 19:54:02,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:02,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:54:02,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:54:02,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:54:02,127 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:02,709 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-11-02 19:54:02,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 19:54:02,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 19:54:02,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:02,711 INFO L225 Difference]: With dead ends: 157 [2022-11-02 19:54:02,711 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 19:54:02,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-02 19:54:02,712 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:02,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 299 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 19:54:02,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 19:54:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-02 19:54:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 125 states have (on average 1.344) internal successors, (168), 156 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2022-11-02 19:54:02,716 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 26 [2022-11-02 19:54:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:02,716 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2022-11-02 19:54:02,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:02,717 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2022-11-02 19:54:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-02 19:54:02,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:02,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:02,738 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:02,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:02,918 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:02,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:02,918 INFO L85 PathProgramCache]: Analyzing trace with hash -83332022, now seen corresponding path program 1 times [2022-11-02 19:54:02,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:02,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1206914515] [2022-11-02 19:54:02,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:02,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:02,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:02,920 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:02,921 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-11-02 19:54:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:03,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 19:54:03,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:03,224 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 19:54:03,232 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 19:54:03,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:54:03,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 19:54:03,323 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 19:54:03,326 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 19:54:03,345 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 19:54:03,346 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:54:03,346 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:03,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1206914515] [2022-11-02 19:54:03,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1206914515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:03,346 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:03,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 19:54:03,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862079632] [2022-11-02 19:54:03,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:03,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 19:54:03,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:03,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 19:54:03,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:54:03,348 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:03,775 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-11-02 19:54:03,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 19:54:03,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-11-02 19:54:03,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:03,776 INFO L225 Difference]: With dead ends: 156 [2022-11-02 19:54:03,777 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 19:54:03,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-11-02 19:54:03,777 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 109 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:03,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 227 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 19:54:03,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 19:54:03,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2022-11-02 19:54:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.3306451612903225) internal successors, (165), 154 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2022-11-02 19:54:03,781 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 27 [2022-11-02 19:54:03,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:03,781 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2022-11-02 19:54:03,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:03,782 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2022-11-02 19:54:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 19:54:03,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:03,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:03,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:03,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:03,991 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:03,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:03,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1522435470, now seen corresponding path program 1 times [2022-11-02 19:54:03,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:03,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623123398] [2022-11-02 19:54:03,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:03,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:03,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:03,993 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:03,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-11-02 19:54:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:04,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-02 19:54:04,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:04,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-02 19:54:04,328 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 19:54:04,328 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 19:54:04,401 INFO L356 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2022-11-02 19:54:04,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 19:54:04,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 19:54:04,500 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:54:04,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 19:54:04,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-02 19:54:04,565 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 19:54:04,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:54:04,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:04,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623123398] [2022-11-02 19:54:04,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623123398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:04,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:04,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 19:54:04,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833911287] [2022-11-02 19:54:04,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:04,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 19:54:04,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:04,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 19:54:04,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:54:04,568 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:05,928 INFO L93 Difference]: Finished difference Result 169 states and 178 transitions. [2022-11-02 19:54:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 19:54:05,929 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 19:54:05,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:05,930 INFO L225 Difference]: With dead ends: 169 [2022-11-02 19:54:05,930 INFO L226 Difference]: Without dead ends: 169 [2022-11-02 19:54:05,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2022-11-02 19:54:05,931 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 186 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:05,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 287 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-02 19:54:05,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-11-02 19:54:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 155. [2022-11-02 19:54:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 154 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 164 transitions. [2022-11-02 19:54:05,936 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 164 transitions. Word has length 29 [2022-11-02 19:54:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:05,937 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 164 transitions. [2022-11-02 19:54:05,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 164 transitions. [2022-11-02 19:54:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 19:54:05,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:05,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:05,957 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:06,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:06,147 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:06,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:06,147 INFO L85 PathProgramCache]: Analyzing trace with hash -296461252, now seen corresponding path program 1 times [2022-11-02 19:54:06,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:06,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1176057307] [2022-11-02 19:54:06,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:06,147 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:06,148 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:06,148 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:06,150 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-11-02 19:54:06,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:06,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 19:54:06,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:06,321 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 19:54:06,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-11-02 19:54:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:54:06,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:54:06,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:06,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1176057307] [2022-11-02 19:54:06,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1176057307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:06,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:06,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 19:54:06,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260476426] [2022-11-02 19:54:06,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:06,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 19:54:06,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:06,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 19:54:06,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 19:54:06,395 INFO L87 Difference]: Start difference. First operand 155 states and 164 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:06,623 INFO L93 Difference]: Finished difference Result 165 states and 174 transitions. [2022-11-02 19:54:06,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 19:54:06,624 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 19:54:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:06,625 INFO L225 Difference]: With dead ends: 165 [2022-11-02 19:54:06,625 INFO L226 Difference]: Without dead ends: 165 [2022-11-02 19:54:06,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 19:54:06,626 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 7 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:06,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 282 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 19:54:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-02 19:54:06,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 158. [2022-11-02 19:54:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 127 states have (on average 1.31496062992126) internal successors, (167), 157 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 167 transitions. [2022-11-02 19:54:06,630 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 167 transitions. Word has length 30 [2022-11-02 19:54:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:06,631 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 167 transitions. [2022-11-02 19:54:06,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 167 transitions. [2022-11-02 19:54:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 19:54:06,632 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:06,632 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:06,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:06,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:06,838 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:06,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:06,839 INFO L85 PathProgramCache]: Analyzing trace with hash -275466542, now seen corresponding path program 1 times [2022-11-02 19:54:06,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:06,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205409174] [2022-11-02 19:54:06,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:06,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:06,840 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:06,841 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:06,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-11-02 19:54:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:06,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 19:54:06,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 19:54:07,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:54:07,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:07,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205409174] [2022-11-02 19:54:07,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205409174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:07,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:07,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 19:54:07,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737929490] [2022-11-02 19:54:07,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:07,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 19:54:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:07,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 19:54:07,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:54:07,046 INFO L87 Difference]: Start difference. First operand 158 states and 167 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:07,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:07,151 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2022-11-02 19:54:07,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 19:54:07,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 19:54:07,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:07,153 INFO L225 Difference]: With dead ends: 160 [2022-11-02 19:54:07,153 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 19:54:07,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 19:54:07,154 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 70 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:07,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 124 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 19:54:07,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 19:54:07,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-11-02 19:54:07,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 129 states have (on average 1.310077519379845) internal successors, (169), 159 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:07,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 169 transitions. [2022-11-02 19:54:07,158 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 169 transitions. Word has length 30 [2022-11-02 19:54:07,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:07,158 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 169 transitions. [2022-11-02 19:54:07,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2022-11-02 19:54:07,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 19:54:07,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:07,159 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:07,171 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:07,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:07,362 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:07,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:07,363 INFO L85 PathProgramCache]: Analyzing trace with hash 2127502605, now seen corresponding path program 1 times [2022-11-02 19:54:07,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:07,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235098159] [2022-11-02 19:54:07,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:07,364 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:07,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:07,365 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:07,366 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-11-02 19:54:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:07,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 19:54:07,653 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:07,707 INFO L356 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-11-02 19:54:07,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-11-02 19:54:07,734 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 19:54:07,818 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:54:07,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 19:54:07,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-11-02 19:54:07,905 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 19:54:07,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:54:07,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:07,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235098159] [2022-11-02 19:54:07,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235098159] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:07,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:07,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:54:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787523939] [2022-11-02 19:54:07,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:07,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:54:07,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:07,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:54:07,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:54:07,907 INFO L87 Difference]: Start difference. First operand 160 states and 169 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:08,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:08,347 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2022-11-02 19:54:08,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 19:54:08,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 19:54:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:08,351 INFO L225 Difference]: With dead ends: 160 [2022-11-02 19:54:08,351 INFO L226 Difference]: Without dead ends: 160 [2022-11-02 19:54:08,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 19:54:08,352 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 52 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:08,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 260 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 147 Invalid, 0 Unknown, 129 Unchecked, 0.4s Time] [2022-11-02 19:54:08,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-02 19:54:08,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2022-11-02 19:54:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 129 states have (on average 1.302325581395349) internal successors, (168), 158 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:08,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2022-11-02 19:54:08,356 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 30 [2022-11-02 19:54:08,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:08,356 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2022-11-02 19:54:08,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:08,357 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2022-11-02 19:54:08,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 19:54:08,357 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:08,357 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:08,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-11-02 19:54:08,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:08,570 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:08,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:08,571 INFO L85 PathProgramCache]: Analyzing trace with hash 2127502606, now seen corresponding path program 1 times [2022-11-02 19:54:08,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:08,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883818187] [2022-11-02 19:54:08,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:08,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:08,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:08,572 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:08,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-11-02 19:54:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:08,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-02 19:54:08,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:08,855 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 19:54:08,868 INFO L356 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-02 19:54:08,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-11-02 19:54:08,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 11 treesize of output 7 [2022-11-02 19:54:08,909 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 19:54:08,995 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 19:54:08,995 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 19:54:09,007 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 19:54:09,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 19:54:09,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 19:54:09,073 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 19:54:09,073 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 19:54:09,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:09,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883818187] [2022-11-02 19:54:09,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883818187] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 19:54:09,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 19:54:09,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 19:54:09,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543244949] [2022-11-02 19:54:09,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 19:54:09,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 19:54:09,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:09,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 19:54:09,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 19:54:09,074 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:10,061 INFO L93 Difference]: Finished difference Result 155 states and 164 transitions. [2022-11-02 19:54:10,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 19:54:10,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 19:54:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:10,063 INFO L225 Difference]: With dead ends: 155 [2022-11-02 19:54:10,063 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 19:54:10,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-11-02 19:54:10,064 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:10,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 335 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-02 19:54:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 19:54:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-11-02 19:54:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 121 states have (on average 1.256198347107438) internal successors, (152), 143 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2022-11-02 19:54:10,067 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 30 [2022-11-02 19:54:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:10,068 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2022-11-02 19:54:10,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-11-02 19:54:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 19:54:10,068 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:10,069 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:10,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:10,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:10,274 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:10,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:10,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1259070453, now seen corresponding path program 1 times [2022-11-02 19:54:10,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:10,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579858523] [2022-11-02 19:54:10,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:10,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:10,275 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:10,276 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:10,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-11-02 19:54:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 19:54:10,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 19:54:10,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 19:54:10,687 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 19:54:10,692 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 19:54:10,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:54:10,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 19:54:11,026 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-02 19:54:11,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-11-02 19:54:11,042 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-02 19:54:11,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-11-02 19:54:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 19:54:11,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-02 19:54:11,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579858523] [2022-11-02 19:54:11,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [579858523] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 19:54:11,115 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 19:54:11,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2022-11-02 19:54:11,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822019173] [2022-11-02 19:54:11,115 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 19:54:11,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 19:54:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-02 19:54:11,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 19:54:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2022-11-02 19:54:11,116 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 19:54:13,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 19:54:13,277 INFO L93 Difference]: Finished difference Result 196 states and 208 transitions. [2022-11-02 19:54:13,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 19:54:13,278 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 19:54:13,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 19:54:13,279 INFO L225 Difference]: With dead ends: 196 [2022-11-02 19:54:13,279 INFO L226 Difference]: Without dead ends: 196 [2022-11-02 19:54:13,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2022-11-02 19:54:13,280 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 246 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-02 19:54:13,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 651 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-02 19:54:13,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-11-02 19:54:13,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 155. [2022-11-02 19:54:13,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.25) internal successors, (165), 154 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 19:54:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2022-11-02 19:54:13,284 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 33 [2022-11-02 19:54:13,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 19:54:13,285 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2022-11-02 19:54:13,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.764705882352941) internal successors, (64), 17 states have internal predecessors, (64), 0 states have call successors, (0), 0 states 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 19:54:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2022-11-02 19:54:13,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 19:54:13,286 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 19:54:13,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:13,302 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:13,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:13,498 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2022-11-02 19:54:13,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 19:54:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash 376478029, now seen corresponding path program 1 times [2022-11-02 19:54:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-02 19:54:13,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [585057452] [2022-11-02 19:54:13,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 19:54:13,499 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-11-02 19:54:13,499 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat [2022-11-02 19:54:13,500 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-02 19:54:13,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-11-02 19:54:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:54:13,681 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-02 19:54:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-02 19:54:13,796 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-02 19:54:13,796 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-02 19:54:13,797 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK (76 of 77 remaining) [2022-11-02 19:54:13,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 77 remaining) [2022-11-02 19:54:13,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 77 remaining) [2022-11-02 19:54:13,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 77 remaining) [2022-11-02 19:54:13,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 77 remaining) [2022-11-02 19:54:13,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 77 remaining) [2022-11-02 19:54:13,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 77 remaining) [2022-11-02 19:54:13,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 77 remaining) [2022-11-02 19:54:13,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 77 remaining) [2022-11-02 19:54:13,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 77 remaining) [2022-11-02 19:54:13,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 77 remaining) [2022-11-02 19:54:13,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 77 remaining) [2022-11-02 19:54:13,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 77 remaining) [2022-11-02 19:54:13,801 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 77 remaining) [2022-11-02 19:54:13,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 77 remaining) [2022-11-02 19:54:13,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 77 remaining) [2022-11-02 19:54:13,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 77 remaining) [2022-11-02 19:54:13,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 77 remaining) [2022-11-02 19:54:13,802 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 77 remaining) [2022-11-02 19:54:13,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 77 remaining) [2022-11-02 19:54:13,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 77 remaining) [2022-11-02 19:54:13,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 77 remaining) [2022-11-02 19:54:13,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 77 remaining) [2022-11-02 19:54:13,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 77 remaining) [2022-11-02 19:54:13,803 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 77 remaining) [2022-11-02 19:54:13,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 77 remaining) [2022-11-02 19:54:13,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 77 remaining) [2022-11-02 19:54:13,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 77 remaining) [2022-11-02 19:54:13,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 77 remaining) [2022-11-02 19:54:13,804 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 77 remaining) [2022-11-02 19:54:13,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 77 remaining) [2022-11-02 19:54:13,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 77 remaining) [2022-11-02 19:54:13,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 77 remaining) [2022-11-02 19:54:13,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 77 remaining) [2022-11-02 19:54:13,805 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 77 remaining) [2022-11-02 19:54:13,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 77 remaining) [2022-11-02 19:54:13,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 77 remaining) [2022-11-02 19:54:13,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 77 remaining) [2022-11-02 19:54:13,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 77 remaining) [2022-11-02 19:54:13,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 77 remaining) [2022-11-02 19:54:13,806 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 77 remaining) [2022-11-02 19:54:13,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_LEAK (35 of 77 remaining) [2022-11-02 19:54:13,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 77 remaining) [2022-11-02 19:54:13,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 77 remaining) [2022-11-02 19:54:13,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (32 of 77 remaining) [2022-11-02 19:54:13,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (31 of 77 remaining) [2022-11-02 19:54:13,807 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (30 of 77 remaining) [2022-11-02 19:54:13,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 77 remaining) [2022-11-02 19:54:13,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 77 remaining) [2022-11-02 19:54:13,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK (27 of 77 remaining) [2022-11-02 19:54:13,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 77 remaining) [2022-11-02 19:54:13,808 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 77 remaining) [2022-11-02 19:54:13,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 77 remaining) [2022-11-02 19:54:13,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 77 remaining) [2022-11-02 19:54:13,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK (22 of 77 remaining) [2022-11-02 19:54:13,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 77 remaining) [2022-11-02 19:54:13,809 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 77 remaining) [2022-11-02 19:54:13,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK (19 of 77 remaining) [2022-11-02 19:54:13,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 77 remaining) [2022-11-02 19:54:13,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 77 remaining) [2022-11-02 19:54:13,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 77 remaining) [2022-11-02 19:54:13,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 77 remaining) [2022-11-02 19:54:13,810 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 77 remaining) [2022-11-02 19:54:13,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 77 remaining) [2022-11-02 19:54:13,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (12 of 77 remaining) [2022-11-02 19:54:13,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (11 of 77 remaining) [2022-11-02 19:54:13,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (10 of 77 remaining) [2022-11-02 19:54:13,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 77 remaining) [2022-11-02 19:54:13,811 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 77 remaining) [2022-11-02 19:54:13,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE (7 of 77 remaining) [2022-11-02 19:54:13,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE (6 of 77 remaining) [2022-11-02 19:54:13,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_FREE (5 of 77 remaining) [2022-11-02 19:54:13,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 77 remaining) [2022-11-02 19:54:13,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 77 remaining) [2022-11-02 19:54:13,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_FREE (2 of 77 remaining) [2022-11-02 19:54:13,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_FREE (1 of 77 remaining) [2022-11-02 19:54:13,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75ASSERT_VIOLATIONMEMORY_FREE (0 of 77 remaining) [2022-11-02 19:54:13,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-11-02 19:54:14,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/mathsat -unsat_core_generation=3 [2022-11-02 19:54:14,029 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 19:54:14,032 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-02 19:54:14,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 07:54:14 BoogieIcfgContainer [2022-11-02 19:54:14,086 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-02 19:54:14,087 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-02 19:54:14,087 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-02 19:54:14,087 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-02 19:54:14,088 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 07:53:43" (3/4) ... [2022-11-02 19:54:14,090 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-02 19:54:14,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-02 19:54:14,091 INFO L158 Benchmark]: Toolchain (without parser) took 32831.66ms. Allocated memory was 67.1MB in the beginning and 117.4MB in the end (delta: 50.3MB). Free memory was 44.8MB in the beginning and 30.3MB in the end (delta: 14.5MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2022-11-02 19:54:14,092 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 47.6MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:54:14,092 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.90ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 40.8MB in the end (delta: 3.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-02 19:54:14,092 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.24ms. Allocated memory is still 67.1MB. Free memory was 40.8MB in the beginning and 38.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 19:54:14,092 INFO L158 Benchmark]: Boogie Preprocessor took 49.77ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 36.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-02 19:54:14,093 INFO L158 Benchmark]: RCFGBuilder took 1071.42ms. Allocated memory is still 67.1MB. Free memory was 36.2MB in the beginning and 26.6MB in the end (delta: 9.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-11-02 19:54:14,093 INFO L158 Benchmark]: TraceAbstraction took 31068.20ms. Allocated memory was 67.1MB in the beginning and 117.4MB in the end (delta: 50.3MB). Free memory was 25.7MB in the beginning and 30.3MB in the end (delta: -4.6MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. [2022-11-02 19:54:14,093 INFO L158 Benchmark]: Witness Printer took 4.30ms. Allocated memory is still 117.4MB. Free memory is still 30.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-02 19:54:14,094 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 47.6MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 580.90ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 40.8MB in the end (delta: 3.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.24ms. Allocated memory is still 67.1MB. Free memory was 40.8MB in the beginning and 38.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.77ms. Allocated memory is still 67.1MB. Free memory was 38.4MB in the beginning and 36.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1071.42ms. Allocated memory is still 67.1MB. Free memory was 36.2MB in the beginning and 26.6MB in the end (delta: 9.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * TraceAbstraction took 31068.20ms. Allocated memory was 67.1MB in the beginning and 117.4MB in the end (delta: 50.3MB). Free memory was 25.7MB in the beginning and 30.3MB in the end (delta: -4.6MB). Peak memory consumption was 44.8MB. Max. memory is 16.1GB. * Witness Printer took 4.30ms. Allocated memory is still 117.4MB. Free memory is still 30.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L998] struct TSLL* null = malloc(sizeof(struct TSLL)); [L999] null->next = ((void*)0) VAL [null={-2147483647:0}] [L1000] null->prev = ((void*)0) VAL [null={-2147483647:0}] [L1001] null->colour = BLACK VAL [null={-2147483647:0}] [L1003] struct TSLL* list = malloc(sizeof(struct TSLL)); [L1004] list->next = null VAL [list={3:0}, null={-2147483647:0}] [L1005] list->prev = null VAL [list={3:0}, null={-2147483647:0}] [L1006] list->colour = BLACK VAL [list={3:0}, null={-2147483647:0}] [L1008] struct TSLL* end = list; VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1011] COND FALSE !(__VERIFIER_nondet_int()) [L1037] end = null [L1038] end = list VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1041] COND FALSE !(!(null != end)) VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1042] EXPR end->colour VAL [end={3:0}, end->colour=1, list={3:0}, null={-2147483647:0}] [L1042] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE null != end VAL [end={3:0}, list={3:0}, null={-2147483647:0}] [L1045] EXPR end->colour VAL [end={3:0}, end->colour=1, list={3:0}, null={-2147483647:0}] [L1045] COND FALSE !(RED == end->colour) [L1052] EXPR end->next VAL [end={3:0}, end->next={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1052] end = end->next [L1043] COND FALSE !(null != end) VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1056] COND TRUE null != list VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1058] EXPR list->colour VAL [end={-2147483647:0}, list={3:0}, list->colour=1, null={-2147483647:0}] [L1058] COND FALSE !(RED == list->colour) [L1067] EXPR list->next VAL [end={-2147483647:0}, list={3:0}, list->next={-2147483647:0}, null={-2147483647:0}] [L1067] end = list->next [L1068] free(list) VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1068] free(list) VAL [end={-2147483647:0}, list={3:0}, null={-2147483647:0}] [L1068] free(list) [L1069] list = end VAL [end={-2147483647:0}, list={-2147483647:0}, null={-2147483647:0}] [L1056] COND FALSE !(null != list) VAL [end={-2147483647:0}, list={-2147483647:0}, null={-2147483647:0}] [L1073] return 0; VAL [\result=0, end={-2147483647:0}, list={-2147483647:0}, null={-2147483647:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1034]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1048]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1049]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1061]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1068]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 164 locations, 77 error locations. Started 1 CEGAR loops. OverallTime: 30.9s, OverallIterations: 25, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2974 SdHoareTripleChecker+Valid, 14.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2974 mSDsluCounter, 6215 SdHoareTripleChecker+Invalid, 12.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 238 IncrementalHoareTripleChecker+Unchecked, 4015 mSDsCounter, 288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5452 IncrementalHoareTripleChecker+Invalid, 5978 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 288 mSolverCounterUnsat, 2200 mSDtfsCounter, 5452 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 582 GetRequests, 410 SyntacticMatches, 2 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=0, InterpolantAutomatonStates: 175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 374 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 510 NumberOfCodeBlocks, 510 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 507 ConstructedInterpolants, 4 QuantifiedInterpolants, 3259 SizeOfPredicates, 101 NumberOfNonLiveVariables, 3539 ConjunctsInSsa, 235 ConjunctsInUnsatCore, 26 InterpolantComputations, 22 PerfectInterpolantSequences, 6/12 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-02 19:54:14,176 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a3053fa4-590b-42aa-907f-bf088a9d23da/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample