./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-reverse.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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/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 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:21:01,675 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:21:01,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:21:01,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:21:01,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:21:01,743 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:21:01,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:21:01,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:21:01,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:21:01,764 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:21:01,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:21:01,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:21:01,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:21:01,773 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:21:01,776 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:21:01,778 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:21:01,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:21:01,783 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:21:01,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:21:01,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:21:01,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:21:01,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:21:01,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:21:01,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:21:01,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:21:01,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:21:01,821 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:21:01,824 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:21:01,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:21:01,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:21:01,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:21:01,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:21:01,832 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:21:01,834 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:21:01,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:21:01,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:21:01,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:21:01,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:21:01,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:21:01,839 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:21:01,840 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:21:01,841 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:21:01,895 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:21:01,895 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:21:01,896 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:21:01,896 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:21:01,898 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:21:01,898 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:21:01,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:21:01,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:21:01,900 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:21:01,900 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:21:01,902 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:21:01,902 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:21:01,903 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:21:01,903 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:21:01,903 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:21:01,904 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:21:01,904 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:21:01,904 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:21:01,904 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:21:01,905 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:21:01,905 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:21:01,905 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:21:01,906 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:21:01,906 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:21:01,906 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:21:01,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:21:01,909 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:21:01,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:21:01,910 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:21:01,910 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:21:01,910 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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/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 -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2022-11-02 20:21:02,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:21:02,314 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:21:02,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:21:02,319 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:21:02,321 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:21:02,322 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/dll-reverse.i [2022-11-02 20:21:02,411 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/data/be91df0b5/adca68fdf79b4fb8bb1fad868dbaf010/FLAGed882528c [2022-11-02 20:21:03,064 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:21:03,069 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/sv-benchmarks/c/forester-heap/dll-reverse.i [2022-11-02 20:21:03,093 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/data/be91df0b5/adca68fdf79b4fb8bb1fad868dbaf010/FLAGed882528c [2022-11-02 20:21:03,353 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/data/be91df0b5/adca68fdf79b4fb8bb1fad868dbaf010 [2022-11-02 20:21:03,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:21:03,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:21:03,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:03,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:21:03,371 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:21:03,372 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:03" (1/1) ... [2022-11-02 20:21:03,375 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e36b73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:03, skipping insertion in model container [2022-11-02 20:21:03,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:21:03" (1/1) ... [2022-11-02 20:21:03,384 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:21:03,462 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:21:04,007 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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2022-11-02 20:21:04,015 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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2022-11-02 20:21:04,023 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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2022-11-02 20:21:04,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:04,049 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:21:04,114 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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/sv-benchmarks/c/forester-heap/dll-reverse.i[22309,22322] [2022-11-02 20:21:04,116 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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/sv-benchmarks/c/forester-heap/dll-reverse.i[22394,22407] [2022-11-02 20:21:04,135 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_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/sv-benchmarks/c/forester-heap/dll-reverse.i[22924,22937] [2022-11-02 20:21:04,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:21:04,181 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:21:04,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04 WrapperNode [2022-11-02 20:21:04,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:21:04,183 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:04,184 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:21:04,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:21:04,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,231 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,274 INFO L138 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2022-11-02 20:21:04,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:21:04,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:21:04,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:21:04,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:21:04,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,306 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,309 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,311 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,314 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:21:04,316 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:21:04,316 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:21:04,316 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:21:04,317 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (1/1) ... [2022-11-02 20:21:04,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:21:04,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:04,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:21:04,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:21:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:21:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:21:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:21:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:21:04,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:21:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:21:04,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:21:04,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:21:04,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:21:04,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:21:04,571 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:21:04,574 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:21:05,421 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:21:05,431 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:21:05,431 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-02 20:21:05,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:05 BoogieIcfgContainer [2022-11-02 20:21:05,435 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:21:05,438 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:21:05,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:21:05,457 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:21:05,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:21:03" (1/3) ... [2022-11-02 20:21:05,459 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc3ae5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:21:05, skipping insertion in model container [2022-11-02 20:21:05,459 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:21:04" (2/3) ... [2022-11-02 20:21:05,460 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc3ae5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:21:05, skipping insertion in model container [2022-11-02 20:21:05,460 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:21:05" (3/3) ... [2022-11-02 20:21:05,462 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2022-11-02 20:21:05,493 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:21:05,494 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 69 error locations. [2022-11-02 20:21:05,567 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:21:05,577 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;@6a617d7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:21:05,577 INFO L358 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2022-11-02 20:21:05,584 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 79 states have (on average 2.1645569620253164) internal successors, (171), 148 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:05,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:21:05,592 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:05,593 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:21:05,594 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:05,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:05,601 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 20:21:05,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:05,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995702627] [2022-11-02 20:21:05,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:05,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:05,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:05,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 20:21:05,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:05,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995702627] [2022-11-02 20:21:05,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995702627] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:05,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:05,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:21:05,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944120570] [2022-11-02 20:21:05,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:05,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:21:05,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:05,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:05,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:05,977 INFO L87 Difference]: Start difference. First operand has 149 states, 79 states have (on average 2.1645569620253164) internal successors, (171), 148 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:06,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:06,321 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-11-02 20:21:06,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:06,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:21:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:06,334 INFO L225 Difference]: With dead ends: 146 [2022-11-02 20:21:06,334 INFO L226 Difference]: Without dead ends: 144 [2022-11-02 20:21:06,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:06,340 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:06,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 128 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:21:06,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-02 20:21:06,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-11-02 20:21:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 78 states have (on average 1.9487179487179487) 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 20:21:06,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2022-11-02 20:21:06,393 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 3 [2022-11-02 20:21:06,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:06,393 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2022-11-02 20:21:06,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-11-02 20:21:06,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:21:06,395 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:06,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:21:06,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:21:06,396 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:06,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:06,397 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 20:21:06,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:06,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663742901] [2022-11-02 20:21:06,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:06,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:06,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:06,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:06,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663742901] [2022-11-02 20:21:06,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663742901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:06,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:06,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:21:06,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015565623] [2022-11-02 20:21:06,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:06,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:21:06,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:06,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:21:06,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:06,511 INFO L87 Difference]: Start difference. First operand 144 states and 152 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:06,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:06,667 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-11-02 20:21:06,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:21:06,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-02 20:21:06,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:06,669 INFO L225 Difference]: With dead ends: 141 [2022-11-02 20:21:06,670 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:21:06,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:21:06,672 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 97 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:06,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 124 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:21:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:21:06,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-11-02 20:21:06,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:06,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2022-11-02 20:21:06,684 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 3 [2022-11-02 20:21:06,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:06,684 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2022-11-02 20:21:06,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:06,685 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2022-11-02 20:21:06,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:21:06,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:06,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:06,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:21:06,706 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:06,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:06,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-11-02 20:21:06,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:06,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116115154] [2022-11-02 20:21:06,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:06,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:06,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:06,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:06,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116115154] [2022-11-02 20:21:06,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116115154] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:06,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:06,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:21:06,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686039383] [2022-11-02 20:21:06,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:06,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:21:06,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:06,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:21:06,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:21:06,975 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:07,247 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2022-11-02 20:21:07,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:21:07,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:21:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:07,255 INFO L225 Difference]: With dead ends: 132 [2022-11-02 20:21:07,255 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 20:21:07,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:07,264 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 168 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:07,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 90 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:07,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 20:21:07,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2022-11-02 20:21:07,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 127 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:07,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-11-02 20:21:07,284 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 9 [2022-11-02 20:21:07,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:07,284 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-11-02 20:21:07,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:07,285 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-11-02 20:21:07,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:21:07,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:07,285 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:07,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:21:07,286 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:07,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-11-02 20:21:07,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:07,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678644409] [2022-11-02 20:21:07,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:07,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:07,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 20:21:07,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:07,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678644409] [2022-11-02 20:21:07,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678644409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:07,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:07,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:21:07,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33909702] [2022-11-02 20:21:07,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:07,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:21:07,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:07,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:21:07,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:21:07,658 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:08,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:08,010 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-11-02 20:21:08,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:21:08,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:21:08,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:08,013 INFO L225 Difference]: With dead ends: 176 [2022-11-02 20:21:08,014 INFO L226 Difference]: Without dead ends: 176 [2022-11-02 20:21:08,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:08,015 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 176 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:08,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 137 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:21:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-02 20:21:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2022-11-02 20:21:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.5945945945945945) internal successors, (177), 156 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2022-11-02 20:21:08,026 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 9 [2022-11-02 20:21:08,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:08,027 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2022-11-02 20:21:08,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:08,027 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2022-11-02 20:21:08,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:08,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:08,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:08,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:21:08,029 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:08,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:08,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-11-02 20:21:08,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:08,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227517059] [2022-11-02 20:21:08,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:08,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:08,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:08,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227517059] [2022-11-02 20:21:08,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227517059] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:08,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:08,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:21:08,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948564741] [2022-11-02 20:21:08,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:08,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:08,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:08,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:08,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:08,480 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:08,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:08,783 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-11-02 20:21:08,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:08,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:21:08,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:08,785 INFO L225 Difference]: With dead ends: 156 [2022-11-02 20:21:08,785 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 20:21:08,786 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 20:21:08,787 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:08,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 297 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:21:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 20:21:08,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-11-02 20:21:08,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 155 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 20:21:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2022-11-02 20:21:08,810 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 12 [2022-11-02 20:21:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:08,811 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2022-11-02 20:21:08,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-11-02 20:21:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-02 20:21:08,812 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:08,812 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:08,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:21:08,818 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:08,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:08,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-11-02 20:21:08,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:08,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713072299] [2022-11-02 20:21:08,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:08,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:09,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:09,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713072299] [2022-11-02 20:21:09,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713072299] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:09,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:09,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:21:09,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300242617] [2022-11-02 20:21:09,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:09,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:09,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:09,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:09,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:09,012 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:09,272 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2022-11-02 20:21:09,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:21:09,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-02 20:21:09,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:09,274 INFO L225 Difference]: With dead ends: 155 [2022-11-02 20:21:09,274 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:21:09,275 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 20:21:09,276 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 7 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:09,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 315 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:21:09,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-11-02 20:21:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.5585585585585586) internal successors, (173), 154 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:09,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2022-11-02 20:21:09,284 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 12 [2022-11-02 20:21:09,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:09,284 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2022-11-02 20:21:09,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2022-11-02 20:21:09,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:21:09,285 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:09,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:09,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:21:09,286 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1455563597, now seen corresponding path program 1 times [2022-11-02 20:21:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:09,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642622313] [2022-11-02 20:21:09,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:09,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:09,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:09,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642622313] [2022-11-02 20:21:09,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642622313] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:09,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:09,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:21:09,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441795383] [2022-11-02 20:21:09,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:09,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:21:09,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:09,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:21:09,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:21:09,365 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:09,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:09,583 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2022-11-02 20:21:09,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:21:09,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-02 20:21:09,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:09,585 INFO L225 Difference]: With dead ends: 167 [2022-11-02 20:21:09,586 INFO L226 Difference]: Without dead ends: 167 [2022-11-02 20:21:09,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:09,587 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 158 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:09,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 190 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:09,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-02 20:21:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2022-11-02 20:21:09,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 154 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 20:21:09,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2022-11-02 20:21:09,595 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 15 [2022-11-02 20:21:09,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:09,595 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2022-11-02 20:21:09,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2022-11-02 20:21:09,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:21:09,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:09,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:09,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:21:09,597 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:09,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:09,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-11-02 20:21:09,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:09,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014960921] [2022-11-02 20:21:09,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:09,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:09,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:09,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014960921] [2022-11-02 20:21:09,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014960921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:09,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:09,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:21:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438205427] [2022-11-02 20:21:09,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:09,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:09,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:09,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:09,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:09,963 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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 20:21:10,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:10,522 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-11-02 20:21:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:21:10,523 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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 20:21:10,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:10,525 INFO L225 Difference]: With dead ends: 155 [2022-11-02 20:21:10,526 INFO L226 Difference]: Without dead ends: 155 [2022-11-02 20:21:10,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:21:10,530 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 168 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:10,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 247 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:21:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-11-02 20:21:10,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-11-02 20:21:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 153 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 20:21:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2022-11-02 20:21:10,542 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 16 [2022-11-02 20:21:10,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:10,544 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2022-11-02 20:21:10,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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 20:21:10,545 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2022-11-02 20:21:10,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-02 20:21:10,546 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:10,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:10,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:21:10,547 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:10,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:10,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-11-02 20:21:10,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:10,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908844333] [2022-11-02 20:21:10,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:10,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:11,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 20:21:11,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:11,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908844333] [2022-11-02 20:21:11,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908844333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:11,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:11,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:11,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501037683] [2022-11-02 20:21:11,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:11,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:21:11,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:11,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:21:11,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:21:11,090 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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 20:21:12,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:12,056 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-11-02 20:21:12,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:21:12,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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 20:21:12,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:12,058 INFO L225 Difference]: With dead ends: 152 [2022-11-02 20:21:12,058 INFO L226 Difference]: Without dead ends: 152 [2022-11-02 20:21:12,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-02 20:21:12,059 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 159 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:12,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 333 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:21:12,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-02 20:21:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 141. [2022-11-02 20:21:12,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 140 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 20:21:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-11-02 20:21:12,070 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 16 [2022-11-02 20:21:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:12,070 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-11-02 20:21:12,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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 20:21:12,071 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-11-02 20:21:12,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-02 20:21:12,072 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:12,072 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 20:21:12,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:21:12,075 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:12,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:12,076 INFO L85 PathProgramCache]: Analyzing trace with hash 743663712, now seen corresponding path program 1 times [2022-11-02 20:21:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:12,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713828457] [2022-11-02 20:21:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:12,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:12,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:12,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713828457] [2022-11-02 20:21:12,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713828457] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:12,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:12,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:21:12,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391764802] [2022-11-02 20:21:12,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:12,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:21:12,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:12,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:21:12,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:21:12,347 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 20:21:12,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:12,664 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2022-11-02 20:21:12,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:21:12,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 20:21:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:12,666 INFO L225 Difference]: With dead ends: 162 [2022-11-02 20:21:12,666 INFO L226 Difference]: Without dead ends: 162 [2022-11-02 20:21:12,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:12,667 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 27 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:12,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 442 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:12,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-11-02 20:21:12,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2022-11-02 20:21:12,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 148 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 20:21:12,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-11-02 20:21:12,676 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 18 [2022-11-02 20:21:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:12,676 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-11-02 20:21:12,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 20:21:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-11-02 20:21:12,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-02 20:21:12,679 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:12,680 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 20:21:12,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:21:12,680 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:12,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:12,682 INFO L85 PathProgramCache]: Analyzing trace with hash -573987105, now seen corresponding path program 1 times [2022-11-02 20:21:12,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:12,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246112669] [2022-11-02 20:21:12,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:12,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:12,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:12,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:12,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246112669] [2022-11-02 20:21:12,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246112669] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:12,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:12,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:21:12,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87188927] [2022-11-02 20:21:12,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:12,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:21:12,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:12,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:21:12,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:21:12,922 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:13,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:13,217 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2022-11-02 20:21:13,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:13,221 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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 20:21:13,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:13,222 INFO L225 Difference]: With dead ends: 168 [2022-11-02 20:21:13,222 INFO L226 Difference]: Without dead ends: 168 [2022-11-02 20:21:13,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:13,224 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 25 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:13,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 319 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:13,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-11-02 20:21:13,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2022-11-02 20:21:13,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 121 states have (on average 1.462809917355372) internal successors, (177), 158 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:13,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2022-11-02 20:21:13,229 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 20 [2022-11-02 20:21:13,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:13,229 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2022-11-02 20:21:13,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2022-11-02 20:21:13,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:21:13,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:13,240 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:13,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:21:13,241 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:13,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:13,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1867739349, now seen corresponding path program 1 times [2022-11-02 20:21:13,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:13,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148021693] [2022-11-02 20:21:13,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:13,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:13,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:13,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 20:21:13,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:13,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148021693] [2022-11-02 20:21:13,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148021693] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:13,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:13,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:21:13,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265705227] [2022-11-02 20:21:13,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:13,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:13,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:13,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:13,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:13,451 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:13,674 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2022-11-02 20:21:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:21:13,675 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:21:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:13,676 INFO L225 Difference]: With dead ends: 158 [2022-11-02 20:21:13,676 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 20:21:13,676 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 20:21:13,677 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:13,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 294 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:13,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 20:21:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-11-02 20:21:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 157 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 20:21:13,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2022-11-02 20:21:13,685 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 22 [2022-11-02 20:21:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:13,686 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2022-11-02 20:21:13,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2022-11-02 20:21:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:21:13,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:13,687 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:13,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:21:13,688 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:13,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1867739348, now seen corresponding path program 1 times [2022-11-02 20:21:13,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:13,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199240171] [2022-11-02 20:21:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:13,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:13,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:13,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:13,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:13,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199240171] [2022-11-02 20:21:13,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199240171] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:13,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:13,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:21:13,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314652919] [2022-11-02 20:21:13,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:13,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:21:13,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:13,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:21:13,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:21:13,948 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:14,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:14,218 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2022-11-02 20:21:14,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:21:14,219 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:21:14,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:14,220 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:21:14,220 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:21:14,220 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 20:21:14,221 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:14,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 284 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:21:14,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:21:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-11-02 20:21:14,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 156 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:14,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2022-11-02 20:21:14,226 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 22 [2022-11-02 20:21:14,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:14,226 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2022-11-02 20:21:14,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:14,227 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2022-11-02 20:21:14,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:21:14,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:14,227 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 20:21:14,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:21:14,228 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:14,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:14,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1012469357, now seen corresponding path program 1 times [2022-11-02 20:21:14,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:14,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425010407] [2022-11-02 20:21:14,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:14,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:14,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:14,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425010407] [2022-11-02 20:21:14,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425010407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:14,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:14,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:21:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565342557] [2022-11-02 20:21:14,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:14,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:21:14,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:14,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:21:14,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:21:14,538 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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 20:21:15,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:15,096 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-11-02 20:21:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:21:15,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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 20:21:15,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:15,098 INFO L225 Difference]: With dead ends: 157 [2022-11-02 20:21:15,098 INFO L226 Difference]: Without dead ends: 157 [2022-11-02 20:21:15,098 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 20:21:15,099 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 140 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:15,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 273 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:21:15,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-02 20:21:15,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2022-11-02 20:21:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.421487603305785) internal successors, (172), 155 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 20:21:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2022-11-02 20:21:15,105 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 26 [2022-11-02 20:21:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:15,106 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2022-11-02 20:21:15,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 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 20:21:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2022-11-02 20:21:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:21:15,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:15,107 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 20:21:15,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:21:15,108 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:15,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:15,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1012469358, now seen corresponding path program 1 times [2022-11-02 20:21:15,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:15,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291269832] [2022-11-02 20:21:15,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:15,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:15,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:15,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:15,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291269832] [2022-11-02 20:21:15,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291269832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:21:15,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:21:15,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:21:15,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836369449] [2022-11-02 20:21:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:21:15,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:21:15,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:15,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:21:15,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:21:15,593 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 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 20:21:16,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:16,272 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2022-11-02 20:21:16,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:21:16,273 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 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 20:21:16,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:16,274 INFO L225 Difference]: With dead ends: 156 [2022-11-02 20:21:16,274 INFO L226 Difference]: Without dead ends: 156 [2022-11-02 20:21:16,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:21:16,275 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 137 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:16,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 313 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:21:16,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-02 20:21:16,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2022-11-02 20:21:16,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 153 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 20:21:16,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2022-11-02 20:21:16,284 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 26 [2022-11-02 20:21:16,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:16,284 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2022-11-02 20:21:16,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 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 20:21:16,285 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2022-11-02 20:21:16,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:21:16,290 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:16,290 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:16,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:21:16,291 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:16,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:16,292 INFO L85 PathProgramCache]: Analyzing trace with hash -560637622, now seen corresponding path program 1 times [2022-11-02 20:21:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:16,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327429102] [2022-11-02 20:21:16,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:16,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:16,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:16,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327429102] [2022-11-02 20:21:16,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327429102] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:16,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464392425] [2022-11-02 20:21:16,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:16,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:16,868 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:16,875 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:16,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:21:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:17,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:21:17,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:17,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:21:17,341 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:21:17,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:21:17,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:21:17,664 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:17,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:21:17,840 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:17,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:21:17,893 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:17,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:21:18,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:18,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:21:18,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:18,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:18,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:18,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-02 20:21:18,983 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:18,984 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 252 treesize of output 227 [2022-11-02 20:21:19,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-11-02 20:21:19,019 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:19,020 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 204 treesize of output 196 [2022-11-02 20:21:25,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:25,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464392425] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:21:25,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:21:25,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-11-02 20:21:25,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113929251] [2022-11-02 20:21:25,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:21:25,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 20:21:25,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:21:25,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 20:21:25,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1002, Unknown=18, NotChecked=0, Total=1190 [2022-11-02 20:21:25,170 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:21:26,427 INFO L93 Difference]: Finished difference Result 225 states and 248 transitions. [2022-11-02 20:21:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:21:26,428 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:21:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:21:26,430 INFO L225 Difference]: With dead ends: 225 [2022-11-02 20:21:26,430 INFO L226 Difference]: Without dead ends: 225 [2022-11-02 20:21:26,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=283, Invalid=1339, Unknown=18, NotChecked=0, Total=1640 [2022-11-02 20:21:26,432 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 517 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 847 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1065 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:21:26,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 847 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 899 Invalid, 0 Unknown, 1065 Unchecked, 0.9s Time] [2022-11-02 20:21:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-02 20:21:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 175. [2022-11-02 20:21:26,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 174 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 20:21:26,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2022-11-02 20:21:26,437 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 29 [2022-11-02 20:21:26,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:21:26,438 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2022-11-02 20:21:26,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:21:26,438 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2022-11-02 20:21:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:21:26,439 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:21:26,440 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:21:26,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:21:26,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:21:26,641 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:21:26,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:21:26,642 INFO L85 PathProgramCache]: Analyzing trace with hash -560637621, now seen corresponding path program 1 times [2022-11-02 20:21:26,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:21:26,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516643808] [2022-11-02 20:21:26,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:26,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:21:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:27,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:21:27,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516643808] [2022-11-02 20:21:27,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516643808] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:21:27,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084469659] [2022-11-02 20:21:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:21:27,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:21:27,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:21:27,491 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:21:27,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:21:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:21:27,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-02 20:21:27,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:21:27,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:21:27,805 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:21:27,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:21:27,821 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 20:21:27,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:21:27,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:21:28,108 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:28,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:21: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 18 treesize of output 20 [2022-11-02 20:21:28,294 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:21:28,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:21:28,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:21:28,323 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:28,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:21:28,400 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:21:28,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:21:28,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:21:28,708 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:28,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:21:28,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:21:28,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:28,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-02 20:21:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:21:28,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:21:29,398 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:21:29,474 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:21:29,511 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-11-02 20:21:29,596 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) .cse0 v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:21:29,649 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_585) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_584) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_589 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_81| Int) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_584))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_585) .cse1 v_ArrVal_588) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_589) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))))))) is different from false [2022-11-02 20:21:29,709 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:29,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-11-02 20:21:29,720 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:29,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-11-02 20:21:29,743 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:29,743 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 632 treesize of output 567 [2022-11-02 20:21:29,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:29,809 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 1872 treesize of output 1783 [2022-11-02 20:21:29,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1768 treesize of output 1736 [2022-11-02 20:21:29,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1736 treesize of output 1656 [2022-11-02 20:21:29,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1656 treesize of output 1576 [2022-11-02 20:21:29,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:21:29,987 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 1576 treesize of output 1436 [2022-11-02 20:22:03,606 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:03,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:22:03,619 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:03,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:22:03,626 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:03,631 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 26 treesize of output 18 [2022-11-02 20:22:03,637 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:03,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:03,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:03,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:22:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:04,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084469659] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:04,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:04,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 37 [2022-11-02 20:22:04,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531256217] [2022-11-02 20:22:04,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:04,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-02 20:22:04,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:04,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-02 20:22:04,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=946, Unknown=5, NotChecked=330, Total=1406 [2022-11-02 20:22:04,067 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:07,074 INFO L93 Difference]: Finished difference Result 387 states and 428 transitions. [2022-11-02 20:22:07,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-02 20:22:07,074 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:22:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:07,078 INFO L225 Difference]: With dead ends: 387 [2022-11-02 20:22:07,078 INFO L226 Difference]: Without dead ends: 387 [2022-11-02 20:22:07,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=486, Invalid=2391, Unknown=5, NotChecked=540, Total=3422 [2022-11-02 20:22:07,080 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 656 mSDsluCounter, 1312 mSDsCounter, 0 mSdLazyCounter, 2119 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1408 SdHoareTripleChecker+Invalid, 3714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 2119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1453 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:07,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 1408 Invalid, 3714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 2119 Invalid, 0 Unknown, 1453 Unchecked, 1.6s Time] [2022-11-02 20:22:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-11-02 20:22:07,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 173. [2022-11-02 20:22:07,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 146 states have (on average 1.356164383561644) internal successors, (198), 172 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:07,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2022-11-02 20:22:07,089 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 29 [2022-11-02 20:22:07,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:07,090 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2022-11-02 20:22:07,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:07,090 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2022-11-02 20:22:07,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:22:07,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:07,091 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] [2022-11-02 20:22:07,143 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:22:07,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:22:07,308 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:22:07,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:07,308 INFO L85 PathProgramCache]: Analyzing trace with hash -557177017, now seen corresponding path program 1 times [2022-11-02 20:22:07,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:07,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047911159] [2022-11-02 20:22:07,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:07,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:07,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:07,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047911159] [2022-11-02 20:22:07,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047911159] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:07,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909865853] [2022-11-02 20:22:07,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:07,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:07,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:07,774 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:07,791 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:22:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:07,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:22:07,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:07,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:22:07,999 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:22:08,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:22:08,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:22:08,150 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:08,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:22:08,258 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:08,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:22:08,283 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:08,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:22:08,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:08,479 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 31 treesize of output 26 [2022-11-02 20:22:08,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:08,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:22:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:08,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:09,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:09,053 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-02 20:22:09,065 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:09,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2022-11-02 20:22:09,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-11-02 20:22:09,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:09,092 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 204 treesize of output 196 [2022-11-02 20:22:14,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:14,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909865853] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:14,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:14,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 32 [2022-11-02 20:22:14,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638118887] [2022-11-02 20:22:14,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:14,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:22:14,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:14,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:22:14,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=887, Unknown=18, NotChecked=0, Total=1056 [2022-11-02 20:22:14,476 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:15,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:15,180 INFO L93 Difference]: Finished difference Result 274 states and 307 transitions. [2022-11-02 20:22:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:22:15,180 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 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 20:22:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:15,182 INFO L225 Difference]: With dead ends: 274 [2022-11-02 20:22:15,182 INFO L226 Difference]: Without dead ends: 274 [2022-11-02 20:22:15,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=243, Invalid=1145, Unknown=18, NotChecked=0, Total=1406 [2022-11-02 20:22:15,183 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 219 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 1870 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1085 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:15,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1051 Invalid, 1870 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 746 Invalid, 0 Unknown, 1085 Unchecked, 0.5s Time] [2022-11-02 20:22:15,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2022-11-02 20:22:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 180. [2022-11-02 20:22:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 179 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2022-11-02 20:22:15,189 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 31 [2022-11-02 20:22:15,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:15,189 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2022-11-02 20:22:15,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:15,190 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2022-11-02 20:22:15,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:22:15,190 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:15,190 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] [2022-11-02 20:22:15,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:22:15,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:22:15,416 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:22:15,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:15,416 INFO L85 PathProgramCache]: Analyzing trace with hash -557177016, now seen corresponding path program 1 times [2022-11-02 20:22:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:15,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120902203] [2022-11-02 20:22:15,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:15,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:16,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120902203] [2022-11-02 20:22:16,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120902203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:16,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322942766] [2022-11-02 20:22:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:16,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:16,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:16,104 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:16,123 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:22:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:16,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-02 20:22:16,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:16,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:22:16,337 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:22:16,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:22:16,344 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 20:22:16,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:22:16,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:22:16,522 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:16,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:22:16,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:22:16,651 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:22:16,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:22:16,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:22:16,676 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:16,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:22:16,727 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:16,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:22:16,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:22:16,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:16,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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 20:22:16,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:16,947 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 31 treesize of output 26 [2022-11-02 20:22:16,983 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:16,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:22:16,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:16,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:16,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-02 20:22:16,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:16,999 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:17,293 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_818 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|) 8))))) is different from false [2022-11-02 20:22:17,336 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_818 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|)))))) is different from false [2022-11-02 20:22:17,362 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_817) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|))))) (forall ((v_ArrVal_818 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|))))))) is different from false [2022-11-02 20:22:17,413 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_818 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_813) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|) 8)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_814))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_813) .cse0 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_817) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|))))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:22:17,442 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_818 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_813) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_814) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|) 8)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_814 (Array Int Int)) (v_ArrVal_813 (Array Int Int)) (v_ArrVal_818 (Array Int Int)) (v_ArrVal_817 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_89| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_89|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_89| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_814))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_813) .cse1 v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_817) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_89|))))))))) is different from false [2022-11-02 20:22:17,491 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:17,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-11-02 20:22:17,501 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:17,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-11-02 20:22:17,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:17,519 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 334 treesize of output 301 [2022-11-02 20:22:17,547 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:17,548 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 950 treesize of output 909 [2022-11-02 20:22:17,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 878 [2022-11-02 20:22:17,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 878 treesize of output 838 [2022-11-02 20:22:17,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 838 treesize of output 798 [2022-11-02 20:22:17,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:17,626 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 798 treesize of output 730 [2022-11-02 20:22:20,049 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:20,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2022-11-02 20:22:20,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:20,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-11-02 20:22:20,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:20,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-11-02 20:22:20,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:20,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:20,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:20,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-11-02 20:22:20,340 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:20,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322942766] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:20,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:20,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 33 [2022-11-02 20:22:20,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336884302] [2022-11-02 20:22:20,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:20,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:22:20,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:22:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=701, Unknown=5, NotChecked=290, Total=1122 [2022-11-02 20:22:20,346 INFO L87 Difference]: Start difference. First operand 180 states and 207 transitions. Second operand has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:21,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:21,973 INFO L93 Difference]: Finished difference Result 277 states and 310 transitions. [2022-11-02 20:22:21,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:22:21,974 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 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 20:22:21,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:21,975 INFO L225 Difference]: With dead ends: 277 [2022-11-02 20:22:21,976 INFO L226 Difference]: Without dead ends: 277 [2022-11-02 20:22:21,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 41 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=273, Invalid=1148, Unknown=5, NotChecked=380, Total=1806 [2022-11-02 20:22:21,977 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 312 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 925 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 955 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:21,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 925 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1054 Invalid, 0 Unknown, 955 Unchecked, 0.9s Time] [2022-11-02 20:22:21,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2022-11-02 20:22:21,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 180. [2022-11-02 20:22:21,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 153 states have (on average 1.34640522875817) internal successors, (206), 179 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:21,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2022-11-02 20:22:21,985 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 31 [2022-11-02 20:22:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:21,985 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2022-11-02 20:22:21,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.727272727272727) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2022-11-02 20:22:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:22:21,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:21,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:22,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:22:22,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:22,204 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:22:22,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:22,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1435398869, now seen corresponding path program 1 times [2022-11-02 20:22:22,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:22,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977310325] [2022-11-02 20:22:22,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:22,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:22:22,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:22,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977310325] [2022-11-02 20:22:22,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977310325] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:22,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492890174] [2022-11-02 20:22:22,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:22,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:22,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:22,338 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:22,352 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:22:22,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:22,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-02 20:22:22,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:22,632 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 17 [2022-11-02 20:22:22,636 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 21 treesize of output 13 [2022-11-02 20:22:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:22:22,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:22:22,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492890174] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:22,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:22,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 15 [2022-11-02 20:22:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486386842] [2022-11-02 20:22:22,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:22,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-02 20:22:22,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:22,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-02 20:22:22,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:22:22,846 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:23,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:23,608 INFO L93 Difference]: Finished difference Result 184 states and 203 transitions. [2022-11-02 20:22:23,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:22:23,609 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:22:23,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:23,610 INFO L225 Difference]: With dead ends: 184 [2022-11-02 20:22:23,610 INFO L226 Difference]: Without dead ends: 184 [2022-11-02 20:22:23,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2022-11-02 20:22:23,611 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 407 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:23,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 294 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-02 20:22:23,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-02 20:22:23,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 168. [2022-11-02 20:22:23,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 143 states have (on average 1.3216783216783217) internal successors, (189), 167 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:23,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 189 transitions. [2022-11-02 20:22:23,617 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 189 transitions. Word has length 34 [2022-11-02 20:22:23,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:23,617 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 189 transitions. [2022-11-02 20:22:23,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:23,618 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 189 transitions. [2022-11-02 20:22:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:22:23,619 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:23,619 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:23,653 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-02 20:22:23,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:23,836 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:22:23,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash -605799936, now seen corresponding path program 1 times [2022-11-02 20:22:23,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:23,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692788883] [2022-11-02 20:22:23,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:23,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:24,427 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:24,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692788883] [2022-11-02 20:22:24,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692788883] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:24,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014622447] [2022-11-02 20:22:24,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:24,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:24,429 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:24,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:24,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:22:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:24,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:22:24,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:24,849 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:22:24,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:22:24,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:22:25,106 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:25,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:22:25,323 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:25,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:22:25,364 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:25,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:22:25,528 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:25,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-02 20:22:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:25,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:26,328 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:26,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-11-02 20:22:26,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:26,346 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 144 treesize of output 131 [2022-11-02 20:22:26,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:26,365 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 116 treesize of output 114 [2022-11-02 20:22:26,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2022-11-02 20:22:30,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:30,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 94 treesize of output 248 [2022-11-02 20:22:32,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:32,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014622447] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:32,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:32,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 36 [2022-11-02 20:22:32,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426971312] [2022-11-02 20:22:32,258 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:32,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-02 20:22:32,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:32,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-02 20:22:32,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1142, Unknown=21, NotChecked=0, Total=1332 [2022-11-02 20:22:32,260 INFO L87 Difference]: Start difference. First operand 168 states and 189 transitions. Second operand has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:33,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:33,183 INFO L93 Difference]: Finished difference Result 258 states and 286 transitions. [2022-11-02 20:22:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:22:33,184 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:22:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:33,185 INFO L225 Difference]: With dead ends: 258 [2022-11-02 20:22:33,185 INFO L226 Difference]: Without dead ends: 258 [2022-11-02 20:22:33,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=320, Invalid=1821, Unknown=21, NotChecked=0, Total=2162 [2022-11-02 20:22:33,186 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 220 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 668 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:33,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 770 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 740 Invalid, 0 Unknown, 668 Unchecked, 0.5s Time] [2022-11-02 20:22:33,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-02 20:22:33,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 201. [2022-11-02 20:22:33,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 176 states have (on average 1.2897727272727273) internal successors, (227), 200 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 227 transitions. [2022-11-02 20:22:33,191 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 227 transitions. Word has length 36 [2022-11-02 20:22:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:33,192 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 227 transitions. [2022-11-02 20:22:33,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5833333333333335) internal successors, (93), 37 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:33,192 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 227 transitions. [2022-11-02 20:22:33,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:22:33,193 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:33,193 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:33,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:22:33,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:22:33,408 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:22:33,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:33,408 INFO L85 PathProgramCache]: Analyzing trace with hash -605799935, now seen corresponding path program 1 times [2022-11-02 20:22:33,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:33,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221993683] [2022-11-02 20:22:33,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:33,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:34,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:34,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:34,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221993683] [2022-11-02 20:22:34,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221993683] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:34,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267464949] [2022-11-02 20:22:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:34,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:34,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:34,118 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:34,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:22:34,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:34,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 50 conjunts are in the unsatisfiable core [2022-11-02 20:22:34,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:34,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:22:34,501 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:22:34,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:22:34,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:22:34,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:22:34,696 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:34,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:22:34,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:22:34,855 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:34,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:22:34,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:34,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:22:34,894 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:34,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-02 20:22:34,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:22:35,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:35,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:22:35,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:35,054 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:35,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-02 20:22:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:35,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:22:35,477 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1187 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:22:35,529 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1186) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1187 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:22:35,558 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1186) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1187 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-11-02 20:22:35,611 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1183))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1182) .cse0 v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|) 4) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1186) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1187 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1182) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem12#1.base| v_ArrVal_1183) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-11-02 20:22:35,644 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1187 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1182) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1183) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1187 (Array Int Int)) (v_ArrVal_1186 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int) (v_ArrVal_1183 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1183))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1182) .cse1 v_ArrVal_1187) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|) 4) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1186) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_103|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_103| |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-11-02 20:22:35,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:35,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:22:35,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:35,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:22:35,700 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 50 treesize of output 42 [2022-11-02 20:22:35,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:35,711 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 100 treesize of output 99 [2022-11-02 20:22:35,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-11-02 20:22:35,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 70 [2022-11-02 20:22:35,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2022-11-02 20:22:35,830 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:35,831 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2022-11-02 20:22:35,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:35,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2022-11-02 20:22:35,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:35,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:35,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:35,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:35,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2022-11-02 20:22:35,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:35,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:35,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:35,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2022-11-02 20:22:35,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-02 20:22:36,312 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:22:36,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-02 20:22:36,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:36,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267464949] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:22:36,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:22:36,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 39 [2022-11-02 20:22:36,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148706425] [2022-11-02 20:22:36,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:22:36,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:22:36,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:22:36,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:22:36,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1070, Unknown=5, NotChecked=350, Total=1560 [2022-11-02 20:22:36,529 INFO L87 Difference]: Start difference. First operand 201 states and 227 transitions. Second operand has 40 states, 39 states have (on average 2.5384615384615383) internal successors, (99), 40 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:38,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:22:38,383 INFO L93 Difference]: Finished difference Result 301 states and 330 transitions. [2022-11-02 20:22:38,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:22:38,386 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.5384615384615383) internal successors, (99), 40 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:22:38,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:22:38,388 INFO L225 Difference]: With dead ends: 301 [2022-11-02 20:22:38,388 INFO L226 Difference]: Without dead ends: 301 [2022-11-02 20:22:38,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=359, Invalid=2206, Unknown=5, NotChecked=510, Total=3080 [2022-11-02 20:22:38,390 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 517 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 1337 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 948 SdHoareTripleChecker+Invalid, 2779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1373 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:22:38,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 948 Invalid, 2779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1337 Invalid, 0 Unknown, 1373 Unchecked, 0.9s Time] [2022-11-02 20:22:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-11-02 20:22:38,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 200. [2022-11-02 20:22:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 175 states have (on average 1.2857142857142858) internal successors, (225), 199 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 225 transitions. [2022-11-02 20:22:38,395 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 225 transitions. Word has length 36 [2022-11-02 20:22:38,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:22:38,395 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 225 transitions. [2022-11-02 20:22:38,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.5384615384615383) internal successors, (99), 40 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:22:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 225 transitions. [2022-11-02 20:22:38,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:22:38,396 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:22:38,396 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:22:38,424 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:22:38,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:22:38,612 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 66 more)] === [2022-11-02 20:22:38,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:22:38,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1311673304, now seen corresponding path program 2 times [2022-11-02 20:22:38,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:22:38,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179759081] [2022-11-02 20:22:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:22:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:22:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:22:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:39,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:22:39,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179759081] [2022-11-02 20:22:39,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179759081] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:22:39,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717380540] [2022-11-02 20:22:39,587 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:22:39,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:22:39,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:22:39,592 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:22:39,593 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8fe793ac-af44-4d2f-9729-b9abcafa8f9c/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:22:39,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:22:39,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:22:39,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-02 20:22:39,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:22:39,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:22:39,833 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:22:39,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:22:39,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:22:39,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:22:39,976 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:22:39,976 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 29 treesize of output 30 [2022-11-02 20:22:39,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-02 20:22:40,099 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:22:40,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2022-11-02 20:22:40,112 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:40,119 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:22:40,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-11-02 20:22:40,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:22:40,192 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:40,194 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:22:40,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 70 [2022-11-02 20:22:40,218 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-11-02 20:22:40,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 58 [2022-11-02 20:22:40,634 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:40,635 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:40,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:40,643 INFO L356 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2022-11-02 20:22:40,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 69 treesize of output 42 [2022-11-02 20:22:40,651 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:22:40,656 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:22:40,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 22 [2022-11-02 20:22:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:22:40,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:23:06,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:06,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 657 treesize of output 506 [2022-11-02 20:23:06,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:06,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 497 treesize of output 362 [2022-11-02 20:23:08,768 INFO L356 Elim1Store]: treesize reduction 238, result has 62.3 percent of original size [2022-11-02 20:23:08,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 14 new quantified variables, introduced 45 case distinctions, treesize of input 11454 treesize of output 10538 [2022-11-02 20:23:08,936 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:23:12,477 INFO L356 Elim1Store]: treesize reduction 382, result has 64.6 percent of original size [2022-11-02 20:23:12,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 15 new quantified variables, introduced 66 case distinctions, treesize of input 156872 treesize of output 136914 [2022-11-02 20:23:16,881 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:16,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 571794 treesize of output 454844 [2022-11-02 20:24:06,091 WARN L234 SmtUtils]: Spent 49.20s on a formula simplification. DAG size of input: 3311 DAG size of output: 3287 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:24:10,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:10,240 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 499115 treesize of output 484501 [2022-11-02 20:24:18,270 WARN L234 SmtUtils]: Spent 8.02s on a formula simplification. DAG size of input: 3562 DAG size of output: 3562 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-02 20:24:19,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:19,964 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 518640 treesize of output 514196 [2022-11-02 20:24:28,573 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:28,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 537101 treesize of output 533475 [2022-11-02 20:24:41,775 WARN L234 SmtUtils]: Spent 13.18s on a formula simplification. DAG size of input: 4170 DAG size of output: 4145 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)