./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/simple-ext_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/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_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/simple-ext_1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/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_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/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 cf7f5d5a0c627430d9132d0f1be3b1c0ad58f22e7924c03137596c145de85b8c --- 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:09:26,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:09:26,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:09:26,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:09:26,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:09:26,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:09:26,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:09:26,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:09:26,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:09:26,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:09:26,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:09:26,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:09:26,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:09:26,741 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:09:26,742 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:09:26,743 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:09:26,744 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:09:26,745 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:09:26,747 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:09:26,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:09:26,750 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:09:26,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:09:26,761 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:09:26,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:09:26,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:09:26,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:09:26,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:09:26,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:09:26,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:09:26,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:09:26,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:09:26,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:09:26,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:09:26,775 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:09:26,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:09:26,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:09:26,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:09:26,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:09:26,778 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:09:26,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:09:26,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:09:26,786 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:09:26,827 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:09:26,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:09:26,828 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:09:26,828 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:09:26,829 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:09:26,829 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:09:26,830 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:09:26,830 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:09:26,830 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:09:26,831 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:09:26,832 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:09:26,832 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:09:26,832 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:09:26,832 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:09:26,832 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:09:26,833 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:09:26,833 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:09:26,833 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:09:26,833 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:09:26,833 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:09:26,833 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:09:26,834 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:09:26,834 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:09:26,834 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:09:26,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:09:26,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:09:26,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:09:26,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:09:26,835 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:09:26,835 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:09:26,835 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_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/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_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/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 -> cf7f5d5a0c627430d9132d0f1be3b1c0ad58f22e7924c03137596c145de85b8c [2022-11-02 20:09:27,069 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:09:27,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:09:27,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:09:27,104 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:09:27,105 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:09:27,106 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-ext-properties/simple-ext_1.i [2022-11-02 20:09:27,193 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/data/1bd196844/72d1fdda33eb447da9c2e68eb6178b47/FLAG21744adb6 [2022-11-02 20:09:27,775 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:09:27,775 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/sv-benchmarks/c/list-ext-properties/simple-ext_1.i [2022-11-02 20:09:27,786 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/data/1bd196844/72d1fdda33eb447da9c2e68eb6178b47/FLAG21744adb6 [2022-11-02 20:09:28,120 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/data/1bd196844/72d1fdda33eb447da9c2e68eb6178b47 [2022-11-02 20:09:28,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:09:28,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:09:28,127 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:09:28,127 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:09:28,131 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:09:28,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,133 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68683321 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28, skipping insertion in model container [2022-11-02 20:09:28,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:09:28,200 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:09:28,606 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_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/sv-benchmarks/c/list-ext-properties/simple-ext_1.i[23274,23287] [2022-11-02 20:09:28,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:09:28,627 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:09:28,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/sv-benchmarks/c/list-ext-properties/simple-ext_1.i[23274,23287] [2022-11-02 20:09:28,694 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:09:28,723 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:09:28,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28 WrapperNode [2022-11-02 20:09:28,724 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:09:28,726 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:09:28,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:09:28,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:09:28,734 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:09:28" (1/1) ... [2022-11-02 20:09:28,767 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:09:28" (1/1) ... [2022-11-02 20:09:28,795 INFO L138 Inliner]: procedures = 124, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 78 [2022-11-02 20:09:28,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:09:28,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:09:28,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:09:28,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:09:28,806 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,806 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,832 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,845 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:09:28,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:09:28,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:09:28,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:09:28,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (1/1) ... [2022-11-02 20:09:28,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:09:28,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:28,890 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:09:28,919 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:09:28,940 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 20:09:28,941 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 20:09:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:09:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:09:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:09:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:09:28,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:09:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:09:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:09:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:09:28,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:09:28,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:09:29,068 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:09:29,070 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:09:29,111 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 20:09:29,352 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:09:29,358 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:09:29,358 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:09:29,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:09:29 BoogieIcfgContainer [2022-11-02 20:09:29,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:09:29,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:09:29,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:09:29,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:09:29,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:09:28" (1/3) ... [2022-11-02 20:09:29,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da47344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:09:29, skipping insertion in model container [2022-11-02 20:09:29,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:09:28" (2/3) ... [2022-11-02 20:09:29,381 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4da47344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:09:29, skipping insertion in model container [2022-11-02 20:09:29,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:09:29" (3/3) ... [2022-11-02 20:09:29,383 INFO L112 eAbstractionObserver]: Analyzing ICFG simple-ext_1.i [2022-11-02 20:09:29,406 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:09:29,406 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 21 error locations. [2022-11-02 20:09:29,480 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:09:29,489 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;@1cae2b59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:09:29,489 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2022-11-02 20:09:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 34 states have (on average 1.911764705882353) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:09:29,504 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:29,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:09:29,506 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:29,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:29,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517416, now seen corresponding path program 1 times [2022-11-02 20:09:29,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:29,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100396077] [2022-11-02 20:09:29,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:29,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:29,672 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:09:29,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:29,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100396077] [2022-11-02 20:09:29,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100396077] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:29,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:29,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:09:29,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106609550] [2022-11-02 20:09:29,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:29,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-02 20:09:29,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:29,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-02 20:09:29,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:09:29,710 INFO L87 Difference]: Start difference. First operand has 58 states, 34 states have (on average 1.911764705882353) internal successors, (65), 56 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have 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:09:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:29,727 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2022-11-02 20:09:29,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-02 20:09:29,729 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-11-02 20:09:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:29,736 INFO L225 Difference]: With dead ends: 58 [2022-11-02 20:09:29,736 INFO L226 Difference]: Without dead ends: 52 [2022-11-02 20:09:29,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-02 20:09:29,741 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:29,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:09:29,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-02 20:09:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-02 20:09:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:09:29,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-02 20:09:29,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 6 [2022-11-02 20:09:29,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:29,776 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-02 20:09:29,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have 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:09:29,777 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-02 20:09:29,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:09:29,778 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:29,778 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:29,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:09:29,778 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:29,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash 620871745, now seen corresponding path program 1 times [2022-11-02 20:09:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:29,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931840565] [2022-11-02 20:09:29,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:29,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:29,930 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:09:29,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:29,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931840565] [2022-11-02 20:09:29,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931840565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:29,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:29,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:09:29,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461333367] [2022-11-02 20:09:29,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:29,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:29,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:29,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:29,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:29,936 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:30,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:30,082 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-11-02 20:09:30,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:09:30,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:09:30,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:30,084 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:09:30,085 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:09:30,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:09:30,086 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 94 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:30,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 31 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:30,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:09:30,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 56. [2022-11-02 20:09:30,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.675) internal successors, (67), 55 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:09:30,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2022-11-02 20:09:30,094 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 8 [2022-11-02 20:09:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:30,094 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2022-11-02 20:09:30,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:30,095 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2022-11-02 20:09:30,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-02 20:09:30,095 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:30,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:30,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:09:30,096 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:30,097 INFO L85 PathProgramCache]: Analyzing trace with hash 620871746, now seen corresponding path program 1 times [2022-11-02 20:09:30,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:30,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672581416] [2022-11-02 20:09:30,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:30,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,313 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:09:30,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:30,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672581416] [2022-11-02 20:09:30,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672581416] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:30,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:30,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:09:30,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129186170] [2022-11-02 20:09:30,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:30,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:30,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:30,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:30,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:30,317 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:30,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:30,449 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-02 20:09:30,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:09:30,450 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-02 20:09:30,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:30,451 INFO L225 Difference]: With dead ends: 77 [2022-11-02 20:09:30,451 INFO L226 Difference]: Without dead ends: 77 [2022-11-02 20:09:30,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:09:30,453 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 99 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:30,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 33 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-02 20:09:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 65. [2022-11-02 20:09:30,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 49 states have (on average 1.489795918367347) internal successors, (73), 64 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:09:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-11-02 20:09:30,483 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 8 [2022-11-02 20:09:30,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:30,485 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-11-02 20:09:30,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-11-02 20:09:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:09:30,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:30,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:30,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:09:30,492 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash -382774458, now seen corresponding path program 1 times [2022-11-02 20:09:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:30,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567080921] [2022-11-02 20:09:30,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:30,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:30,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:30,896 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:09:30,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:30,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567080921] [2022-11-02 20:09:30,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567080921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:30,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:30,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:09:30,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875949408] [2022-11-02 20:09:30,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:30,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:09:30,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:30,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:09:30,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:09:30,900 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:31,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:31,261 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-11-02 20:09:31,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:09:31,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-02 20:09:31,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:31,266 INFO L225 Difference]: With dead ends: 140 [2022-11-02 20:09:31,267 INFO L226 Difference]: Without dead ends: 140 [2022-11-02 20:09:31,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:09:31,270 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 115 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:31,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 127 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:09:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-11-02 20:09:31,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 69. [2022-11-02 20:09:31,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.471698113207547) internal successors, (78), 68 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:09:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 78 transitions. [2022-11-02 20:09:31,289 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 78 transitions. Word has length 14 [2022-11-02 20:09:31,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:31,290 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 78 transitions. [2022-11-02 20:09:31,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 78 transitions. [2022-11-02 20:09:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:09:31,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:31,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:31,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:09:31,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:31,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1017634056, now seen corresponding path program 1 times [2022-11-02 20:09:31,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:31,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759208929] [2022-11-02 20:09:31,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:31,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:31,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:31,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759208929] [2022-11-02 20:09:31,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759208929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:31,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:31,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:09:31,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235893231] [2022-11-02 20:09:31,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:31,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:31,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:31,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:31,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:31,383 INFO L87 Difference]: Start difference. First operand 69 states and 78 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:09:31,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:31,481 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-02 20:09:31,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:09:31,481 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:09:31,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:31,484 INFO L225 Difference]: With dead ends: 76 [2022-11-02 20:09:31,484 INFO L226 Difference]: Without dead ends: 76 [2022-11-02 20:09:31,485 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:09:31,490 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:31,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 52 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-02 20:09:31,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2022-11-02 20:09:31,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 53 states have (on average 1.4150943396226414) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:31,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-02 20:09:31,498 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 15 [2022-11-02 20:09:31,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:31,499 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-02 20:09:31,499 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:09:31,499 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-02 20:09:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:09:31,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:31,500 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:31,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:09:31,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:31,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:31,501 INFO L85 PathProgramCache]: Analyzing trace with hash -90857936, now seen corresponding path program 1 times [2022-11-02 20:09:31,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:31,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701063154] [2022-11-02 20:09:31,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:31,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:31,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:31,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701063154] [2022-11-02 20:09:31,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701063154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:31,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164754027] [2022-11-02 20:09:31,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:31,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:31,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:31,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:31,897 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:09:31,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:31,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 20:09:31,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:32,143 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:09:32,155 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:09:32,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:09:32,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:09:32,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:32,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:32,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2022-11-02 20:09:32,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:32,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:32,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164754027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:32,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:32,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 16 [2022-11-02 20:09:32,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66874061] [2022-11-02 20:09:32,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:32,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:09:32,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:32,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:09:32,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:09:32,796 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:09:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:33,142 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2022-11-02 20:09:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:09:33,143 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:09:33,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:33,144 INFO L225 Difference]: With dead ends: 100 [2022-11-02 20:09:33,144 INFO L226 Difference]: Without dead ends: 100 [2022-11-02 20:09:33,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:09:33,145 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 195 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 26 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:33,146 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 169 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 240 Invalid, 0 Unknown, 26 Unchecked, 0.2s Time] [2022-11-02 20:09:33,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-02 20:09:33,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2022-11-02 20:09:33,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:09:33,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2022-11-02 20:09:33,151 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 17 [2022-11-02 20:09:33,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:33,152 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2022-11-02 20:09:33,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:09:33,152 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2022-11-02 20:09:33,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:09:33,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:33,153 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:33,193 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:33,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:33,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:33,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:33,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204603, now seen corresponding path program 1 times [2022-11-02 20:09:33,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:33,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208803234] [2022-11-02 20:09:33,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:33,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:33,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:33,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:33,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208803234] [2022-11-02 20:09:33,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208803234] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:33,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:33,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:09:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642211737] [2022-11-02 20:09:33,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:33,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:33,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:33,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:33,522 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:33,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:33,676 INFO L93 Difference]: Finished difference Result 74 states and 80 transitions. [2022-11-02 20:09:33,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:09:33,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:09:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:33,678 INFO L225 Difference]: With dead ends: 74 [2022-11-02 20:09:33,678 INFO L226 Difference]: Without dead ends: 74 [2022-11-02 20:09:33,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:09:33,679 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:33,679 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 123 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:33,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-02 20:09:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2022-11-02 20:09:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have 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:09:33,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-11-02 20:09:33,684 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 17 [2022-11-02 20:09:33,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:33,685 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-11-02 20:09:33,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:33,685 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-11-02 20:09:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:09:33,686 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:33,686 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:33,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:09:33,687 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:33,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:33,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1332204604, now seen corresponding path program 1 times [2022-11-02 20:09:33,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:33,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470326025] [2022-11-02 20:09:33,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:33,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:33,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:33,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:33,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470326025] [2022-11-02 20:09:33,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470326025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:33,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:33,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:09:33,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123651092] [2022-11-02 20:09:33,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:33,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:33,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:33,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:33,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:33,913 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:34,122 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-11-02 20:09:34,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:09:34,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-02 20:09:34,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:34,123 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:09:34,124 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:09:34,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:09:34,124 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 34 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:34,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 144 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:34,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:09:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2022-11-02 20:09:34,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 59 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:09:34,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 66 transitions. [2022-11-02 20:09:34,128 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 66 transitions. Word has length 17 [2022-11-02 20:09:34,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:34,129 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 66 transitions. [2022-11-02 20:09:34,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:34,129 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 66 transitions. [2022-11-02 20:09:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:09:34,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:34,130 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:09:34,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:09:34,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:34,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:34,131 INFO L85 PathProgramCache]: Analyzing trace with hash 76906689, now seen corresponding path program 1 times [2022-11-02 20:09:34,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:34,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722154203] [2022-11-02 20:09:34,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:34,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:09:34,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:34,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722154203] [2022-11-02 20:09:34,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722154203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:09:34,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:09:34,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:09:34,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498443122] [2022-11-02 20:09:34,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:09:34,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:09:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:34,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:09:34,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:09:34,184 INFO L87 Difference]: Start difference. First operand 60 states and 66 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:34,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:34,252 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-02 20:09:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:09:34,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:09:34,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:34,253 INFO L225 Difference]: With dead ends: 70 [2022-11-02 20:09:34,254 INFO L226 Difference]: Without dead ends: 70 [2022-11-02 20:09:34,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:09:34,255 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:34,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 39 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:09:34,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-02 20:09:34,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2022-11-02 20:09:34,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 60 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have 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:09:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2022-11-02 20:09:34,259 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 22 [2022-11-02 20:09:34,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:34,259 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2022-11-02 20:09:34,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2022-11-02 20:09:34,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:09:34,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:34,260 INFO L195 NwaCegarLoop]: trace histogram [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:09:34,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:09:34,261 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:34,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:34,261 INFO L85 PathProgramCache]: Analyzing trace with hash -296680512, now seen corresponding path program 1 times [2022-11-02 20:09:34,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:34,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739645453] [2022-11-02 20:09:34,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:34,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:34,634 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:09:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739645453] [2022-11-02 20:09:34,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739645453] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:34,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475272097] [2022-11-02 20:09:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:34,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:34,635 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:34,636 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:34,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:09:34,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:34,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 38 conjunts are in the unsatisfiable core [2022-11-02 20:09:34,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:34,813 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:09:34,856 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:09:34,856 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:09:34,925 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 13 treesize of output 9 [2022-11-02 20:09:34,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:34,942 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:09:34,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-02 20:09:35,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:09:35,107 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:09:35,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:09:35,184 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:35,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-11-02 20:09:35,210 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:09:35,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:35,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-11-02 20:09:35,401 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-11-02 20:09:35,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 0) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-11-02 20:09:35,433 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_171 Int) (v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_171)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) is different from false [2022-11-02 20:09:35,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:35,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-11-02 20:09:35,557 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:35,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 33 [2022-11-02 20:09:35,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-02 20:09:35,580 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:09:35,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-02 20:09:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:09:35,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475272097] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:35,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:35,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 30 [2022-11-02 20:09:35,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177300342] [2022-11-02 20:09:35,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:35,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-02 20:09:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:35,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-02 20:09:35,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=557, Unknown=4, NotChecked=204, Total=870 [2022-11-02 20:09:35,769 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:36,311 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|))) (and (forall ((v_ArrVal_171 Int) (v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_171)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (<= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (= (select .cse0 0) 0) (= .cse1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= .cse1 0) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)))) is different from false [2022-11-02 20:09:36,883 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((v_ArrVal_171 Int) (v_ArrVal_176 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_35| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_171)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_176) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_35|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_35| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_35|)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= |c_ULTIMATE.start_main_~p~0#1.offset| |c_ULTIMATE.start_main_~a~0#1.offset|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|))) is different from false [2022-11-02 20:09:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:37,477 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2022-11-02 20:09:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:09:37,478 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-02 20:09:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:37,479 INFO L225 Difference]: With dead ends: 121 [2022-11-02 20:09:37,479 INFO L226 Difference]: Without dead ends: 121 [2022-11-02 20:09:37,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=208, Invalid=866, Unknown=6, NotChecked=402, Total=1482 [2022-11-02 20:09:37,480 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 115 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 335 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:37,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 378 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 473 Invalid, 0 Unknown, 335 Unchecked, 0.4s Time] [2022-11-02 20:09:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-02 20:09:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 76. [2022-11-02 20:09:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.2537313432835822) internal successors, (84), 75 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:37,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2022-11-02 20:09:37,485 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 23 [2022-11-02 20:09:37,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:37,485 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2022-11-02 20:09:37,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:37,486 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2022-11-02 20:09:37,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:09:37,486 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:37,487 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:37,527 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:37,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:37,703 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:37,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:37,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1909738955, now seen corresponding path program 1 times [2022-11-02 20:09:37,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:37,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663805914] [2022-11-02 20:09:37,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:37,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:38,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:09:38,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:38,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663805914] [2022-11-02 20:09:38,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663805914] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:38,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571359565] [2022-11-02 20:09:38,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:38,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:38,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:38,039 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:38,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:09:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:38,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:09:38,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:38,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:09:38,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:09:38,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:38,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2022-11-02 20:09:38,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:38,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2022-11-02 20:09:38,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:09:38,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:38,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 21 [2022-11-02 20:09:38,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:38,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:38,963 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:09:38,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571359565] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:38,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:38,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 20 [2022-11-02 20:09:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713408564] [2022-11-02 20:09:38,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:38,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-02 20:09:38,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:38,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-02 20:09:38,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:09:38,967 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:09:39,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:39,273 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-02 20:09:39,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:09:39,274 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-02 20:09:39,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:39,275 INFO L225 Difference]: With dead ends: 91 [2022-11-02 20:09:39,275 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 20:09:39,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:09:39,276 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 163 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 77 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:39,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 181 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 178 Invalid, 0 Unknown, 77 Unchecked, 0.1s Time] [2022-11-02 20:09:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 20:09:39,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2022-11-02 20:09:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 75 states have (on average 1.2266666666666666) internal successors, (92), 83 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have 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:09:39,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2022-11-02 20:09:39,279 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 25 [2022-11-02 20:09:39,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:39,279 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2022-11-02 20:09:39,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:09:39,280 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2022-11-02 20:09:39,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:09:39,280 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:39,280 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:09:39,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:39,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:09:39,490 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:39,491 INFO L85 PathProgramCache]: Analyzing trace with hash -927635976, now seen corresponding path program 1 times [2022-11-02 20:09:39,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:39,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973008942] [2022-11-02 20:09:39,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:39,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:39,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:09:39,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:39,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973008942] [2022-11-02 20:09:39,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973008942] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:39,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932541329] [2022-11-02 20:09:39,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:39,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:39,605 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:39,606 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:39,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:09:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:39,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-02 20:09:39,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:39,740 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 13 treesize of output 9 [2022-11-02 20:09:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:09:39,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:39,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:09:39,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932541329] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:39,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:39,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 20:09:39,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096625871] [2022-11-02 20:09:39,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:39,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:09:39,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:39,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:09:39,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:09:39,800 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:39,894 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-11-02 20:09:39,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:09:39,895 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-02 20:09:39,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:39,895 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:09:39,895 INFO L226 Difference]: Without dead ends: 67 [2022-11-02 20:09:39,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:09:39,896 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 23 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:39,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 107 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 22 Unchecked, 0.1s Time] [2022-11-02 20:09:39,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-02 20:09:39,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-02 20:09:39,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.2758620689655173) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:09:39,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-11-02 20:09:39,899 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 26 [2022-11-02 20:09:39,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:39,900 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-11-02 20:09:39,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:09:39,900 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-11-02 20:09:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:09:39,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:39,901 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:39,941 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:40,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-02 20:09:40,102 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:40,102 INFO L85 PathProgramCache]: Analyzing trace with hash 638411638, now seen corresponding path program 1 times [2022-11-02 20:09:40,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:40,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460647659] [2022-11-02 20:09:40,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:40,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:40,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:40,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460647659] [2022-11-02 20:09:40,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460647659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:40,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726987341] [2022-11-02 20:09:40,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:40,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:40,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:40,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:09:40,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:40,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-02 20:09:40,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:40,756 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:09:40,756 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:09:40,823 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 13 treesize of output 9 [2022-11-02 20:09:40,980 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:09:40,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, 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:09:41,006 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:09:41,012 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:09:41,135 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:09:41,136 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 27 treesize of output 13 [2022-11-02 20:09:41,197 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:41,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:41,522 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:41,522 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 24 treesize of output 25 [2022-11-02 20:09:41,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:41,533 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 40 treesize of output 39 [2022-11-02 20:09:41,539 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 9 [2022-11-02 20:09:44,089 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:44,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 111 treesize of output 381 [2022-11-02 20:09:57,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:57,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726987341] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:09:57,246 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:09:57,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-11-02 20:09:57,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771608673] [2022-11-02 20:09:57,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:09:57,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-02 20:09:57,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:09:57,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-02 20:09:57,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=947, Unknown=7, NotChecked=0, Total=1122 [2022-11-02 20:09:57,249 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:09:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:09:57,820 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2022-11-02 20:09:57,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:09:57,821 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 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:09:57,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:09:57,822 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:09:57,822 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:09:57,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=289, Invalid=1264, Unknown=7, NotChecked=0, Total=1560 [2022-11-02 20:09:57,824 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 262 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:09:57,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 361 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 463 Invalid, 0 Unknown, 312 Unchecked, 0.4s Time] [2022-11-02 20:09:57,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:09:57,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 71. [2022-11-02 20:09:57,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:09:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-11-02 20:09:57,828 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 26 [2022-11-02 20:09:57,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:09:57,831 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-11-02 20:09:57,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 34 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:09:57,831 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-11-02 20:09:57,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:09:57,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:09:57,836 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:09:57,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:09:58,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:09:58,055 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:09:58,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:09:58,056 INFO L85 PathProgramCache]: Analyzing trace with hash 638411639, now seen corresponding path program 1 times [2022-11-02 20:09:58,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:09:58,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367804743] [2022-11-02 20:09:58,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:58,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:09:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:58,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:09:58,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367804743] [2022-11-02 20:09:58,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367804743] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:09:58,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858068614] [2022-11-02 20:09:58,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:09:58,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:09:58,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:09:58,672 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:09:58,679 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:09:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:09:58,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-02 20:09:58,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:09:58,839 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:09:58,853 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:09:58,853 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:09:58,904 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 13 treesize of output 9 [2022-11-02 20:09:58,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:09:59,073 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:09:59,073 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:09:59,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:59,085 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:09:59,107 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:09:59,107 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:09:59,112 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:09:59,242 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:09:59,243 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 17 treesize of output 7 [2022-11-02 20:09:59,246 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:09:59,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:59,249 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 27 treesize of output 16 [2022-11-02 20:09:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:09:59,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:09:59,524 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_61| Int) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (or (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_61| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_368) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_61|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_61| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_61| Int) (v_ArrVal_367 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_61|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_61| |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_61| 4)))))) is different from false [2022-11-02 20:09:59,630 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_61| Int) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_61|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_61| |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_61| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_368) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_61| Int) (v_ArrVal_367 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_61|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_61| 4))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_61| |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-11-02 20:09:59,656 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_61| Int) (v_ArrVal_367 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_61|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_61| 4))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_61| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_61| Int) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_61|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_61| |c_ULTIMATE.start_main_~a~0#1.offset|)) (let ((.cse1 (+ |v_ULTIMATE.start_main_~p~0#1.offset_61| 4))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_367) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_368) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))))) is different from false [2022-11-02 20:09:59,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:59,674 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 45 treesize of output 46 [2022-11-02 20:09:59,681 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:59,682 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 35 treesize of output 36 [2022-11-02 20:09:59,695 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:59,695 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 62 treesize of output 61 [2022-11-02 20:09:59,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:59,727 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 96 treesize of output 89 [2022-11-02 20:09:59,735 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 74 treesize of output 66 [2022-11-02 20:09:59,743 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 36 treesize of output 28 [2022-11-02 20:09:59,815 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:09:59,816 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 22 treesize of output 23 [2022-11-02 20:09:59,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:09:59,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:59,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:09:59,826 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 20 treesize of output 8 [2022-11-02 20:10:00,062 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:00,062 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:10:00,269 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-11-02 20:10:00,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858068614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:00,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:00,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2022-11-02 20:10:00,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665161965] [2022-11-02 20:10:00,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:00,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-11-02 20:10:00,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:00,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-11-02 20:10:00,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=846, Unknown=3, NotChecked=186, Total=1190 [2022-11-02 20:10:00,272 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:10:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:01,474 INFO L93 Difference]: Finished difference Result 120 states and 132 transitions. [2022-11-02 20:10:01,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:10:01,474 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 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:10:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:01,475 INFO L225 Difference]: With dead ends: 120 [2022-11-02 20:10:01,475 INFO L226 Difference]: Without dead ends: 120 [2022-11-02 20:10:01,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=418, Invalid=1753, Unknown=3, NotChecked=276, Total=2450 [2022-11-02 20:10:01,477 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 305 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 297 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:01,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 368 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 590 Invalid, 0 Unknown, 297 Unchecked, 0.5s Time] [2022-11-02 20:10:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-02 20:10:01,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 70. [2022-11-02 20:10:01,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.278688524590164) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have 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:10:01,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-11-02 20:10:01,481 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 26 [2022-11-02 20:10:01,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:01,481 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-11-02 20:10:01,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.176470588235294) internal successors, (74), 35 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have 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:10:01,482 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-11-02 20:10:01,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:10:01,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:01,482 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] [2022-11-02 20:10:01,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:01,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:10:01,699 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:10:01,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:01,699 INFO L85 PathProgramCache]: Analyzing trace with hash -666737801, now seen corresponding path program 1 times [2022-11-02 20:10:01,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:01,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372946276] [2022-11-02 20:10:01,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:01,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:01,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:02,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:02,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372946276] [2022-11-02 20:10:02,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372946276] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:02,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980302959] [2022-11-02 20:10:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:02,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:02,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:02,549 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:02,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:10:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:02,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 61 conjunts are in the unsatisfiable core [2022-11-02 20:10:02,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:02,741 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:02,741 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:10:02,775 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 13 treesize of output 9 [2022-11-02 20:10:02,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:02,906 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:10:02,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:10:02,935 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:10:02,967 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:02,968 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 59 treesize of output 54 [2022-11-02 20:10:02,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-02 20:10:02,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:10:03,118 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:03,119 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 17 treesize of output 7 [2022-11-02 20:10:03,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:03,127 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:03,128 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 29 treesize of output 18 [2022-11-02 20:10:03,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:10:03,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:03,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:03,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 Int) (v_ArrVal_435 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_66| Int) (v_ArrVal_433 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_66| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_66|)) (= (let ((.cse0 (+ |v_ULTIMATE.start_main_~p~0#1.offset_66| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_434)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1))) is different from false [2022-11-02 20:10:03,386 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 458 treesize of output 414 [2022-11-02 20:10:04,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:04,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:10:04,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:04,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 20:10:04,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:10:04,070 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-11-02 20:10:04,070 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 22 treesize of output 1 [2022-11-02 20:10:04,373 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:04,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 72 treesize of output 180 [2022-11-02 20:10:04,735 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:04,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980302959] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:10:04,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:10:04,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 33 [2022-11-02 20:10:04,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165549993] [2022-11-02 20:10:04,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:10:04,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:10:04,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:10:04,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:10:04,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=878, Unknown=1, NotChecked=60, Total=1056 [2022-11-02 20:10:04,737 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:10:05,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:10:05,775 INFO L93 Difference]: Finished difference Result 118 states and 128 transitions. [2022-11-02 20:10:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:10:05,775 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:10:05,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:10:05,776 INFO L225 Difference]: With dead ends: 118 [2022-11-02 20:10:05,776 INFO L226 Difference]: Without dead ends: 118 [2022-11-02 20:10:05,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=281, Invalid=1528, Unknown=1, NotChecked=82, Total=1892 [2022-11-02 20:10:05,777 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 386 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 410 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:10:05,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 437 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 633 Invalid, 0 Unknown, 410 Unchecked, 0.5s Time] [2022-11-02 20:10:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-02 20:10:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 72. [2022-11-02 20:10:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 63 states have (on average 1.2698412698412698) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have 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:10:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-11-02 20:10:05,780 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 28 [2022-11-02 20:10:05,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:10:05,780 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-11-02 20:10:05,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 33 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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:10:05,781 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-11-02 20:10:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:10:05,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:10:05,781 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:10:05,824 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:10:05,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:05,995 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:10:05,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:10:05,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1442763871, now seen corresponding path program 2 times [2022-11-02 20:10:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:10:05,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092661815] [2022-11-02 20:10:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:10:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:10:06,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:10:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:06,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:10:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092661815] [2022-11-02 20:10:06,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092661815] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:10:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026906315] [2022-11-02 20:10:06,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:10:06,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:10:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:10:06,818 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:10:06,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:10:06,926 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:10:06,926 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:10:06,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 54 conjunts are in the unsatisfiable core [2022-11-02 20:10:06,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:10:07,018 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:10:07,018 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:10:07,032 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:10:07,092 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 13 treesize of output 9 [2022-11-02 20:10:07,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:10:07,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:10:07,284 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:10:07,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-11-02 20:10:07,339 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:07,348 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-02 20:10:07,349 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 60 treesize of output 42 [2022-11-02 20:10:07,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-11-02 20:10:07,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:07,913 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:07,932 INFO L356 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-02 20:10:07,932 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 87 treesize of output 53 [2022-11-02 20:10:07,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:10:07,940 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 19 treesize of output 7 [2022-11-02 20:10:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:10:07,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:10:09,978 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 75 treesize of output 53 [2022-11-02 20:10:19,812 WARN L234 SmtUtils]: Spent 9.68s on a formula simplification. DAG size of input: 51 DAG size of output: 37 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:10:19,833 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:19,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-11-02 20:10:19,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:19,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 23 [2022-11-02 20:10:19,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:19,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 39 [2022-11-02 20:10:22,515 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:22,516 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 168 treesize of output 139 [2022-11-02 20:10:22,555 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:22,556 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 199 treesize of output 226 [2022-11-02 20:10:22,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:22,576 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 164 treesize of output 161 [2022-11-02 20:10:22,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:22,596 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 152 treesize of output 153 [2022-11-02 20:10:22,613 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:10:22,614 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 144 treesize of output 145 [2022-11-02 20:11:07,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:07,827 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 188 treesize of output 257 [2022-11-02 20:11:10,684 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:10,684 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 74 treesize of output 144 [2022-11-02 20:11:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:11,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026906315] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:11,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:11,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 42 [2022-11-02 20:11:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889911310] [2022-11-02 20:11:11,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:11,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-02 20:11:11,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:11,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-02 20:11:11,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1552, Unknown=22, NotChecked=0, Total=1722 [2022-11-02 20:11:11,021 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:11:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:12,136 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-11-02 20:11:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-02 20:11:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 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:11:12,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:12,143 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:11:12,143 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:11:12,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=259, Invalid=2475, Unknown=22, NotChecked=0, Total=2756 [2022-11-02 20:11:12,145 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 397 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:12,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 541 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 407 Invalid, 0 Unknown, 397 Unchecked, 0.3s Time] [2022-11-02 20:11:12,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:11:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2022-11-02 20:11:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 74 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:11:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2022-11-02 20:11:12,148 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 31 [2022-11-02 20:11:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:12,148 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2022-11-02 20:11:12,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.9761904761904763) internal successors, (83), 42 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have 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:11:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2022-11-02 20:11:12,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:11:12,150 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:12,150 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:12,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:12,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:11:12,363 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:11:12,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:12,364 INFO L85 PathProgramCache]: Analyzing trace with hash 118832262, now seen corresponding path program 2 times [2022-11-02 20:11:12,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:12,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568744039] [2022-11-02 20:11:12,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:12,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:12,908 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:12,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:12,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568744039] [2022-11-02 20:11:12,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568744039] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:12,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007876736] [2022-11-02 20:11:12,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:11:12,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:12,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:12,911 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:12,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:11:13,035 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:11:13,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:13,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 20:11:13,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:13,126 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:11:13,182 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:11:13,182 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:11:13,257 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 13 treesize of output 9 [2022-11-02 20:11:13,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:13,268 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:11:13,322 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 31 treesize of output 13 [2022-11-02 20:11:13,434 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:11:13,456 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:11:13,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:11:13,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:13,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:11:13,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2022-11-02 20:11:13,650 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:11:13,659 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:11:13,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:13,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:13,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2022-11-02 20:11:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:13,758 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:13,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) is different from false [2022-11-02 20:11:13,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0))) is different from false [2022-11-02 20:11:13,929 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0))) is different from false [2022-11-02 20:11:13,942 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) is different from false [2022-11-02 20:11:14,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) is different from false [2022-11-02 20:11:14,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) is different from false [2022-11-02 20:11:14,367 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:14,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-11-02 20:11:14,383 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:14,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 121 [2022-11-02 20:11:14,393 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 98 [2022-11-02 20:11:14,401 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 98 treesize of output 94 [2022-11-02 20:11:14,425 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-11-02 20:11:14,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 22 [2022-11-02 20:11:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-11-02 20:11:14,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007876736] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:14,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:14,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 43 [2022-11-02 20:11:14,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828529126] [2022-11-02 20:11:14,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:14,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:11:14,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:14,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:11:14,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1161, Unknown=10, NotChecked=450, Total=1806 [2022-11-02 20:11:14,683 INFO L87 Difference]: Start difference. First operand 75 states and 83 transitions. Second operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:16,680 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0))) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base|))) is different from false [2022-11-02 20:11:16,692 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|))))) is different from false [2022-11-02 20:11:16,898 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) (forall ((v_ArrVal_593 Int) (v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) v_ArrVal_593)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|))))) is different from false [2022-11-02 20:11:16,959 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)) (= (select (select (store |c_#memory_int| .cse0 v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0))) (forall ((v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)) (= (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0))))) is different from false [2022-11-02 20:11:17,014 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0)))) is different from false [2022-11-02 20:11:17,040 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) (forall ((v_ArrVal_597 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int)) (|v_ULTIMATE.start_main_~t~0#1.base_32| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_32|) 0)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_597) |v_ULTIMATE.start_main_~t~0#1.base_32| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|))))) is different from false [2022-11-02 20:11:17,122 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_78| Int) (v_ArrVal_599 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_599) |c_ULTIMATE.start_main_~a~0#1.base|) |v_ULTIMATE.start_main_~p~0#1.offset_78|) 0) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_78| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_78|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|) |c_ULTIMATE.start_main_~i~0#1|)) is different from false [2022-11-02 20:11:17,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:17,277 INFO L93 Difference]: Finished difference Result 139 states and 151 transitions. [2022-11-02 20:11:17,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-02 20:11:17,277 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:11:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:17,279 INFO L225 Difference]: With dead ends: 139 [2022-11-02 20:11:17,279 INFO L226 Difference]: Without dead ends: 139 [2022-11-02 20:11:17,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=502, Invalid=2287, Unknown=19, NotChecked=1482, Total=4290 [2022-11-02 20:11:17,281 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 164 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 877 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:17,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 503 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 708 Invalid, 0 Unknown, 877 Unchecked, 0.5s Time] [2022-11-02 20:11:17,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-02 20:11:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 90. [2022-11-02 20:11:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 81 states have (on average 1.2345679012345678) internal successors, (100), 89 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have 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:11:17,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2022-11-02 20:11:17,294 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 32 [2022-11-02 20:11:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:17,294 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2022-11-02 20:11:17,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 43 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:17,295 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2022-11-02 20:11:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-02 20:11:17,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:17,296 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:17,335 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:17,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:17,512 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:11:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:17,512 INFO L85 PathProgramCache]: Analyzing trace with hash 798890632, now seen corresponding path program 1 times [2022-11-02 20:11:17,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:17,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772672012] [2022-11-02 20:11:17,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:17,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:17,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:17,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772672012] [2022-11-02 20:11:17,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772672012] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:17,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1126359182] [2022-11-02 20:11:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:17,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:17,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:17,602 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:17,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:11:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:17,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:11:17,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:17,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:17,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:17,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1126359182] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:17,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:17,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-11-02 20:11:17,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803799621] [2022-11-02 20:11:17,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:17,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:11:17,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:17,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:11:17,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:11:17,832 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:11:17,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:17,981 INFO L93 Difference]: Finished difference Result 292 states and 308 transitions. [2022-11-02 20:11:17,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:11:17,982 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-11-02 20:11:17,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:17,983 INFO L225 Difference]: With dead ends: 292 [2022-11-02 20:11:17,983 INFO L226 Difference]: Without dead ends: 292 [2022-11-02 20:11:17,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:11:17,984 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 312 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:17,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 281 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:11:17,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2022-11-02 20:11:17,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 125. [2022-11-02 20:11:17,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 116 states have (on average 1.1724137931034482) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:17,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-11-02 20:11:17,989 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 32 [2022-11-02 20:11:17,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:17,989 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-11-02 20:11:17,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:11:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-11-02 20:11:17,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:11:17,990 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:17,991 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:18,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:18,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:11:18,207 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:11:18,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:18,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1785556241, now seen corresponding path program 1 times [2022-11-02 20:11:18,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:18,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741809805] [2022-11-02 20:11:18,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:18,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:18,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741809805] [2022-11-02 20:11:18,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741809805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:18,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231444950] [2022-11-02 20:11:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:18,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:18,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:18,818 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:18,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:11:18,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:18,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-02 20:11:18,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:19,039 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:19,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:11:19,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:19,212 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:19,212 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 30 treesize of output 28 [2022-11-02 20:11:19,232 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:19,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:11:19,332 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:19,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:19,335 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 26 treesize of output 15 [2022-11-02 20:11:19,367 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:11:19,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:19,472 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_90| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_90| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_90|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_745) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_90| 4)) 0)))) is different from false [2022-11-02 20:11:19,518 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_90| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_90| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_90|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_745) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_90| 4)) 0)))) is different from false [2022-11-02 20:11:19,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_745 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_90| Int)) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_90| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_90|)) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)) v_ArrVal_745) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_90| 4)) 0)))) is different from false [2022-11-02 20:11:19,541 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:19,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:11:19,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:19,552 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 39 treesize of output 38 [2022-11-02 20:11:19,558 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 22 treesize of output 18 [2022-11-02 20:11:19,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:19,836 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 71 treesize of output 141 [2022-11-02 20:11:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-11-02 20:11:20,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231444950] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:20,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:20,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2022-11-02 20:11:20,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884281492] [2022-11-02 20:11:20,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:20,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-02 20:11:20,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:20,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-02 20:11:20,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=919, Unknown=3, NotChecked=192, Total=1260 [2022-11-02 20:11:20,803 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have 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:11:21,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:21,977 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2022-11-02 20:11:21,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:11:21,978 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 states have internal predecessors, (86), 0 states have call successors, (0), 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:11:21,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:21,979 INFO L225 Difference]: With dead ends: 158 [2022-11-02 20:11:21,979 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 20:11:21,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=489, Invalid=2171, Unknown=4, NotChecked=306, Total=2970 [2022-11-02 20:11:21,981 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 257 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:21,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 372 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 677 Invalid, 0 Unknown, 286 Unchecked, 0.5s Time] [2022-11-02 20:11:21,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 20:11:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 134. [2022-11-02 20:11:21,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 125 states have (on average 1.168) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:21,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-11-02 20:11:21,985 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 34 [2022-11-02 20:11:21,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:21,985 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-11-02 20:11:21,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.388888888888889) internal successors, (86), 36 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have 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:11:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-11-02 20:11:21,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:11:21,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:21,986 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:22,014 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:22,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:22,199 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:11:22,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:22,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1083714800, now seen corresponding path program 3 times [2022-11-02 20:11:22,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:22,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672393410] [2022-11-02 20:11:22,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:22,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:22,882 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:22,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:22,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672393410] [2022-11-02 20:11:22,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672393410] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:22,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236043343] [2022-11-02 20:11:22,883 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-02 20:11:22,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:22,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:22,887 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:22,892 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:11:23,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-02 20:11:23,044 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:23,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 43 conjunts are in the unsatisfiable core [2022-11-02 20:11:23,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:23,128 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:23,129 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:11:23,153 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 13 treesize of output 9 [2022-11-02 20:11:23,224 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:11:23,251 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:23,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:11:23,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:11:23,492 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:11:23,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 53 [2022-11-02 20:11:23,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:11:23,594 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:11:23,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 60 [2022-11-02 20:11:23,729 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:23,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:23,732 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 27 treesize of output 16 [2022-11-02 20:11:23,739 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:23,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:24,103 INFO L356 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-11-02 20:11:24,104 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 31 treesize of output 30 [2022-11-02 20:11:24,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_836 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_95| Int) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (= |c_ULTIMATE.start_main_~p~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_836) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_95| 4))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_95|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_95| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:11:24,214 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:24,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-02 20:11:24,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:24,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 20:11:24,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:24,559 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 164 treesize of output 157 [2022-11-02 20:11:24,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:24,581 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 152 treesize of output 124 [2022-11-02 20:11:24,589 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 110 treesize of output 94 [2022-11-02 20:11:24,605 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:11:24,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-02 20:11:24,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:24,930 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:11:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-02 20:11:25,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236043343] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:25,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:25,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 18] total 39 [2022-11-02 20:11:25,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652398466] [2022-11-02 20:11:25,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:25,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-02 20:11:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:25,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-02 20:11:25,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1290, Unknown=15, NotChecked=74, Total=1560 [2022-11-02 20:11:25,180 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:26,027 INFO L93 Difference]: Finished difference Result 146 states and 159 transitions. [2022-11-02 20:11:26,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-02 20:11:26,029 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-11-02 20:11:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:26,030 INFO L225 Difference]: With dead ends: 146 [2022-11-02 20:11:26,031 INFO L226 Difference]: Without dead ends: 146 [2022-11-02 20:11:26,032 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 47 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=335, Invalid=1910, Unknown=15, NotChecked=92, Total=2352 [2022-11-02 20:11:26,032 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 103 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:26,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 453 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 448 Invalid, 0 Unknown, 415 Unchecked, 0.3s Time] [2022-11-02 20:11:26,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-02 20:11:26,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2022-11-02 20:11:26,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 135 states have (on average 1.1703703703703703) internal successors, (158), 143 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:26,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 158 transitions. [2022-11-02 20:11:26,036 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 158 transitions. Word has length 35 [2022-11-02 20:11:26,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:26,037 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 158 transitions. [2022-11-02 20:11:26,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.1538461538461537) internal successors, (84), 40 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:26,037 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 158 transitions. [2022-11-02 20:11:26,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:11:26,038 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:26,038 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:26,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:26,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2022-11-02 20:11:26,247 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:11:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1083714801, now seen corresponding path program 2 times [2022-11-02 20:11:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:26,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777346619] [2022-11-02 20:11:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:27,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:27,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777346619] [2022-11-02 20:11:27,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777346619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:27,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2029429000] [2022-11-02 20:11:27,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:11:27,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:27,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:27,111 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:27,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:11:27,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:11:27,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:27,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-02 20:11:27,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:27,323 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:27,323 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:11:27,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:27,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:27,493 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:27,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-11-02 20:11:27,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:27,505 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:11:27,569 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:27,569 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:11:27,640 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:11:27,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2022-11-02 20:11:27,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:27,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:11:27,893 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:11:27,893 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:11:27,925 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:11:27,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 55 [2022-11-02 20:11:27,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-11-02 20:11:28,096 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:11:28,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 73 [2022-11-02 20:11:28,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:28,105 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:11:28,125 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-11-02 20:11:28,248 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:28,249 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 17 treesize of output 7 [2022-11-02 20:11:28,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:28,254 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:28,254 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 27 treesize of output 16 [2022-11-02 20:11:28,265 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:28,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:28,469 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) (let ((.cse0 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_102|))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_102| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_102|))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_102| |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-11-02 20:11:28,567 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) (let ((.cse0 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_102|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_102| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_102| |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_102|)))))) is different from false [2022-11-02 20:11:28,591 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4)))) (and (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_102| Int)) (or (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_102|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_102| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_102|))) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_102| |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-11-02 20:11:28,608 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:28,609 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 81 treesize of output 85 [2022-11-02 20:11:28,742 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_23 Int) (v_prenex_24 (Array Int Int)) (v_prenex_22 (Array Int Int))) (or (not (<= v_prenex_23 |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 v_prenex_23)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_prenex_24) |c_ULTIMATE.start_main_~t~0#1.base| v_prenex_22) |c_ULTIMATE.start_main_~a~0#1.base|) (+ v_prenex_23 4))))) (forall ((v_ArrVal_932 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_102| Int) (v_ArrVal_928 (Array Int Int))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_928) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_932) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) (+ 5 |c_ULTIMATE.start_main_~p~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_102| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (forall ((v_ArrVal_933 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_102| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_933) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_102|)) |c_ULTIMATE.start_main_~p~0#1.base|) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_102| |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2022-11-02 20:11:28,959 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:28,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-02 20:11:29,577 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,578 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 133 treesize of output 124 [2022-11-02 20:11:29,587 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,587 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 113 treesize of output 114 [2022-11-02 20:11:29,615 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 272 treesize of output 278 [2022-11-02 20:11:29,629 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 243 treesize of output 235 [2022-11-02 20:11:29,637 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 235 treesize of output 219 [2022-11-02 20:11:29,647 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 219 treesize of output 211 [2022-11-02 20:11:29,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 218 treesize of output 266 [2022-11-02 20:11:29,715 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,715 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 346 treesize of output 339 [2022-11-02 20:11:29,735 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 323 treesize of output 319 [2022-11-02 20:11:29,748 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 319 treesize of output 303 [2022-11-02 20:11:29,771 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:29,771 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 340 treesize of output 304 [2022-11-02 20:11:31,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:31,301 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 57 treesize of output 127 [2022-11-02 20:11:31,959 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 20:11:31,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2029429000] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:31,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:31,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 18] total 45 [2022-11-02 20:11:31,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244577350] [2022-11-02 20:11:31,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:31,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-11-02 20:11:31,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:31,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-11-02 20:11:31,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1513, Unknown=19, NotChecked=332, Total=2070 [2022-11-02 20:11:31,962 INFO L87 Difference]: Start difference. First operand 144 states and 158 transitions. Second operand has 46 states, 45 states have (on average 2.111111111111111) internal successors, (95), 46 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:11:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:33,522 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2022-11-02 20:11:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-02 20:11:33,523 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.111111111111111) internal successors, (95), 46 states have internal predecessors, (95), 0 states have call successors, (0), 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 35 [2022-11-02 20:11:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:33,524 INFO L225 Difference]: With dead ends: 180 [2022-11-02 20:11:33,525 INFO L226 Difference]: Without dead ends: 180 [2022-11-02 20:11:33,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1111 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=504, Invalid=2799, Unknown=19, NotChecked=460, Total=3782 [2022-11-02 20:11:33,527 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 243 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 649 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:33,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 544 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 595 Invalid, 0 Unknown, 649 Unchecked, 0.4s Time] [2022-11-02 20:11:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-11-02 20:11:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 143. [2022-11-02 20:11:33,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.164179104477612) internal successors, (156), 142 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have 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:11:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2022-11-02 20:11:33,532 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 35 [2022-11-02 20:11:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:33,532 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2022-11-02 20:11:33,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.111111111111111) internal successors, (95), 46 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have 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:11:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2022-11-02 20:11:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:11:33,534 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:33,534 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:33,557 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:33,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:11:33,739 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:11:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:33,740 INFO L85 PathProgramCache]: Analyzing trace with hash 2067838577, now seen corresponding path program 2 times [2022-11-02 20:11:33,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:33,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290305444] [2022-11-02 20:11:33,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:33,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:34,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:34,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290305444] [2022-11-02 20:11:34,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290305444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:34,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98680819] [2022-11-02 20:11:34,980 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:11:34,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:34,981 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:34,983 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:35,003 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:11:35,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:11:35,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:11:35,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-02 20:11:35,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:35,232 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:11:35,233 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:11:35,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:35,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:35,594 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:35,594 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:11:35,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:35,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:11:35,620 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:11:35,692 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:11:35,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-11-02 20:11:35,792 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:11:35,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2022-11-02 20:11:35,804 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:11:35,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:35,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:11:36,079 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:11:36,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 71 [2022-11-02 20:11:36,090 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:36,091 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 93 treesize of output 85 [2022-11-02 20:11:36,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:36,109 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 22 treesize of output 24 [2022-11-02 20:11:36,143 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:11:36,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 99 [2022-11-02 20:11:36,155 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:36,156 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 110 treesize of output 103 [2022-11-02 20:11:36,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-11-02 20:11:36,394 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:36,395 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:36,402 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:36,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 30 [2022-11-02 20:11:36,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:36,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 17 [2022-11-02 20:11:36,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:11:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:36,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:36,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_108| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_108|)) (= (let ((.cse0 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1036) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_108| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:11:36,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_108| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_108|)) (= (let ((.cse0 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1036) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_108| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:11:36,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_108| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_108|)) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_1036) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1035) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_108| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:11:36,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1030 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_108| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_108|)) (= (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|))) (select (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 v_ArrVal_1030)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1036) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_108| |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2022-11-02 20:11:36,951 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:36,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2022-11-02 20:11:36,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:36,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2022-11-02 20:11:36,980 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:36,981 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 118 treesize of output 121 [2022-11-02 20:11:36,992 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 45 treesize of output 27 [2022-11-02 20:11:37,040 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 10 treesize of output 6 [2022-11-02 20:11:37,051 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 30 treesize of output 22 [2022-11-02 20:11:37,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:37,948 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 155 treesize of output 146 [2022-11-02 20:11:37,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:37,961 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 135 treesize of output 136 [2022-11-02 20:11:37,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:37,979 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 338 treesize of output 247 [2022-11-02 20:11:37,989 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 227 treesize of output 219 [2022-11-02 20:11:37,999 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 219 treesize of output 203 [2022-11-02 20:11:38,041 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:38,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 440 treesize of output 446 [2022-11-02 20:11:38,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:38,068 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 411 treesize of output 352 [2022-11-02 20:11:38,091 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:38,091 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 343 treesize of output 328 [2022-11-02 20:11:38,109 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 319 treesize of output 311 [2022-11-02 20:11:38,124 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 311 treesize of output 295 [2022-11-02 20:11:41,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:41,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 164 treesize of output 426 [2022-11-02 20:11:44,816 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-11-02 20:11:44,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98680819] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:44,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:44,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 20] total 51 [2022-11-02 20:11:44,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350272113] [2022-11-02 20:11:44,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:44,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 20:11:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:44,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 20:11:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1942, Unknown=4, NotChecked=372, Total=2550 [2022-11-02 20:11:44,819 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 51 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:47,345 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~p~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base|) 1) (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~p~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_108| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_108|)) (= (let ((.cse2 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|))) (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 .cse1 v_ArrVal_1030)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1036) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_108| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-02 20:11:49,291 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~t~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~t~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~a~0#1.base|) 4) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~a~0#1.base|) 4) |c_ULTIMATE.start_main_~p~0#1.base|) (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~p~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= |c_ULTIMATE.start_main_~p~0#1.offset| 0) (forall ((v_ArrVal_1030 Int) (v_ArrVal_1029 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1035 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_108| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_108|)) (= (let ((.cse2 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_108|))) (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 .cse1 v_ArrVal_1030)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1036) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) .cse1 |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1035) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) 1) (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_108| |c_ULTIMATE.start_main_~a~0#1.offset|)))) (= |c_ULTIMATE.start_main_~i~0#1| 1))) is different from false [2022-11-02 20:11:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:50,906 INFO L93 Difference]: Finished difference Result 181 states and 194 transitions. [2022-11-02 20:11:50,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-02 20:11:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:11:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:50,911 INFO L225 Difference]: With dead ends: 181 [2022-11-02 20:11:50,911 INFO L226 Difference]: Without dead ends: 181 [2022-11-02 20:11:50,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 68 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1294 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=492, Invalid=3548, Unknown=16, NotChecked=774, Total=4830 [2022-11-02 20:11:50,913 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 210 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 2318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 980 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:50,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 673 Invalid, 2318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1253 Invalid, 0 Unknown, 980 Unchecked, 0.9s Time] [2022-11-02 20:11:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-02 20:11:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 143. [2022-11-02 20:11:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.164179104477612) internal successors, (156), 142 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have 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:11:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 156 transitions. [2022-11-02 20:11:50,917 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 156 transitions. Word has length 37 [2022-11-02 20:11:50,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:50,918 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 156 transitions. [2022-11-02 20:11:50,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0392156862745097) internal successors, (104), 51 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:11:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2022-11-02 20:11:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:11:50,919 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:50,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:50,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:11:51,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:51,120 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:11:51,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:51,120 INFO L85 PathProgramCache]: Analyzing trace with hash -63445765, now seen corresponding path program 1 times [2022-11-02 20:11:51,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:51,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980615237] [2022-11-02 20:11:51,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:51,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:51,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:51,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980615237] [2022-11-02 20:11:51,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980615237] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:51,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643391112] [2022-11-02 20:11:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:51,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:51,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:51,649 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:51,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:11:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:51,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-02 20:11:51,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:51,895 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:51,895 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:11:51,908 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:11:51,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:51,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:52,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:11:52,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:11:52,187 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:52,189 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 37 treesize of output 35 [2022-11-02 20:11:52,221 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:52,221 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 46 treesize of output 45 [2022-11-02 20:11:52,226 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 22 treesize of output 24 [2022-11-02 20:11:52,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:52,753 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 31 treesize of output 21 [2022-11-02 20:11:52,763 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:52,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 15 [2022-11-02 20:11:52,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:52,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:11:56,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:56,266 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 46 treesize of output 36 [2022-11-02 20:11:56,300 INFO L356 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2022-11-02 20:11:56,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 73 [2022-11-02 20:11:56,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:11:56,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2022-11-02 20:11:56,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:56,371 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 55 [2022-11-02 20:11:56,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:56,382 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 31 treesize of output 32 [2022-11-02 20:11:56,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:56,399 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 54 treesize of output 55 [2022-11-02 20:11:56,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:56,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 122 [2022-11-02 20:11:56,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-11-02 20:11:56,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:56,461 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 84 treesize of output 84 [2022-11-02 20:11:57,243 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:11:57,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 84 [2022-11-02 20:11:57,575 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:11:57,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643391112] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:11:57,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:11:57,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 19] total 48 [2022-11-02 20:11:57,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529136009] [2022-11-02 20:11:57,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:11:57,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-02 20:11:57,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:11:57,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-02 20:11:57,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=2078, Unknown=8, NotChecked=0, Total=2352 [2022-11-02 20:11:57,581 INFO L87 Difference]: Start difference. First operand 143 states and 156 transitions. Second operand has 49 states, 48 states have (on average 2.3541666666666665) internal successors, (113), 49 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:11:58,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:11:58,513 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-02 20:11:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:11:58,513 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.3541666666666665) internal successors, (113), 49 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-02 20:11:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:11:58,515 INFO L225 Difference]: With dead ends: 146 [2022-11-02 20:11:58,515 INFO L226 Difference]: Without dead ends: 146 [2022-11-02 20:11:58,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=448, Invalid=2966, Unknown=8, NotChecked=0, Total=3422 [2022-11-02 20:11:58,517 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 130 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 246 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:11:58,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 446 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 339 Invalid, 0 Unknown, 246 Unchecked, 0.2s Time] [2022-11-02 20:11:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-02 20:11:58,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2022-11-02 20:11:58,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.1567164179104477) internal successors, (155), 142 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:11:58,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 155 transitions. [2022-11-02 20:11:58,521 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 155 transitions. Word has length 39 [2022-11-02 20:11:58,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:11:58,521 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 155 transitions. [2022-11-02 20:11:58,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.3541666666666665) internal successors, (113), 49 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have 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:11:58,522 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 155 transitions. [2022-11-02 20:11:58,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:11:58,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:11:58,523 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:11:58,551 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-11-02 20:11:58,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:58,739 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:11:58,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:11:58,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1966820183, now seen corresponding path program 1 times [2022-11-02 20:11:58,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:11:58,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452769470] [2022-11-02 20:11:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:58,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:11:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:11:59,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:11:59,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452769470] [2022-11-02 20:11:59,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452769470] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:11:59,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896123363] [2022-11-02 20:11:59,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:11:59,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:11:59,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:11:59,179 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:11:59,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:11:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:11:59,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:11:59,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:11:59,426 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:11:59,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 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:11:59,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:11:59,680 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:59,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2022-11-02 20:11:59,710 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:11:59,710 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 33 treesize of output 34 [2022-11-02 20:12:00,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:00,006 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2022-11-02 20:12:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:12:00,115 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:12:00,648 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:00,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:12:00,659 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:00,659 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 39 treesize of output 38 [2022-11-02 20:12:00,665 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 22 treesize of output 18 [2022-11-02 20:12:00,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:00,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 84 [2022-11-02 20:12:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-02 20:12:01,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896123363] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:12:01,132 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:12:01,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17, 17] total 38 [2022-11-02 20:12:01,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628758913] [2022-11-02 20:12:01,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:12:01,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-02 20:12:01,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:12:01,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-02 20:12:01,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1233, Unknown=4, NotChecked=0, Total=1406 [2022-11-02 20:12:01,134 INFO L87 Difference]: Start difference. First operand 143 states and 155 transitions. Second operand has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:12:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:12:01,812 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2022-11-02 20:12:01,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:12:01,813 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 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 40 [2022-11-02 20:12:01,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:12:01,814 INFO L225 Difference]: With dead ends: 143 [2022-11-02 20:12:01,814 INFO L226 Difference]: Without dead ends: 143 [2022-11-02 20:12:01,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=372, Invalid=2074, Unknown=4, NotChecked=0, Total=2450 [2022-11-02 20:12:01,815 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 90 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:12:01,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 397 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 311 Invalid, 0 Unknown, 227 Unchecked, 0.2s Time] [2022-11-02 20:12:01,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-11-02 20:12:01,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-11-02 20:12:01,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 134 states have (on average 1.1492537313432836) internal successors, (154), 142 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have 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:12:01,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 154 transitions. [2022-11-02 20:12:01,819 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 154 transitions. Word has length 40 [2022-11-02 20:12:01,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:12:01,819 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 154 transitions. [2022-11-02 20:12:01,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 38 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have 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:12:01,819 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 154 transitions. [2022-11-02 20:12:01,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-02 20:12:01,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:12:01,820 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:12:01,858 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:12:02,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:02,021 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 18 more)] === [2022-11-02 20:12:02,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:12:02,021 INFO L85 PathProgramCache]: Analyzing trace with hash 267970341, now seen corresponding path program 4 times [2022-11-02 20:12:02,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:12:02,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784952926] [2022-11-02 20:12:02,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:12:02,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:12:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:12:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:03,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:12:03,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784952926] [2022-11-02 20:12:03,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784952926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:12:03,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695004080] [2022-11-02 20:12:03,165 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-02 20:12:03,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:12:03,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:12:03,167 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:12:03,191 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7fbc52f-0bb9-403e-a6e4-23cb903ccb97/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:12:03,332 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-02 20:12:03,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:12:03,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 69 conjunts are in the unsatisfiable core [2022-11-02 20:12:03,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:12:03,419 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:12:03,419 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:12:03,486 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 13 treesize of output 9 [2022-11-02 20:12:03,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:12:03,735 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:12:03,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-11-02 20:12:03,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:12:03,760 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:12:03,761 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:12:03,827 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:12:03,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-02 20:12:03,919 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:12:03,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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:12:04,219 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:12:04,219 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:12:04,244 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:12:04,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 54 [2022-11-02 20:12:04,321 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:12:04,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 62 [2022-11-02 20:12:04,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-02 20:12:04,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:12:04,546 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 17 treesize of output 7 [2022-11-02 20:12:04,774 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:12:04,784 INFO L356 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-11-02 20:12:04,785 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 64 treesize of output 35 [2022-11-02 20:12:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:12:06,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:12:07,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_136| Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_136|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_136| |c_ULTIMATE.start_main_~a~0#1.offset|)) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1264))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse2 4))) 1) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_136|)) (<= (+ .cse2 1) 0))))) is different from false [2022-11-02 20:12:07,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_136| Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (let ((.cse1 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_136|))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_136| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_136|)) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1264))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ 4 .cse2))) 1) (<= (+ .cse2 1) 0))))) is different from false [2022-11-02 20:12:07,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_136| Int) (v_ArrVal_1265 (Array Int Int)) (v_ArrVal_1264 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 4))) (.cse1 (+ 4 |v_ULTIMATE.start_main_~p~0#1.offset_136|))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1265) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (or (not (<= |v_ULTIMATE.start_main_~p~0#1.offset_136| |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~p~0#1.offset_136|)) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1264))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (+ .cse3 4))) 1) (<= (+ .cse3 1) 0))))) is different from false [2022-11-02 20:12:07,484 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:07,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-02 20:12:07,879 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:07,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 112 [2022-11-02 20:12:07,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:07,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 71 [2022-11-02 20:12:07,909 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:07,909 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 333 treesize of output 326 [2022-11-02 20:12:09,448 INFO L356 Elim1Store]: treesize reduction 390, result has 58.3 percent of original size [2022-11-02 20:12:09,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 5804 treesize of output 5627 [2022-11-02 20:12:09,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:09,760 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 5351 treesize of output 3799 [2022-11-02 20:12:09,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:12:09,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3656 treesize of output 3240 [2022-11-02 20:12:10,086 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 328 treesize of output 244 [2022-11-02 20:12:10,192 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 275 treesize of output 195