./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8 --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 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 11:12:01,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 11:12:01,891 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 11:12:01,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 11:12:01,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 11:12:01,910 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 11:12:01,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 11:12:01,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 11:12:01,914 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 11:12:01,915 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 11:12:01,915 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 11:12:01,916 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 11:12:01,917 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 11:12:01,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 11:12:01,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 11:12:01,920 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 11:12:01,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 11:12:01,921 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 11:12:01,923 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 11:12:01,924 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 11:12:01,926 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 11:12:01,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 11:12:01,928 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 11:12:01,929 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 11:12:01,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 11:12:01,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 11:12:01,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 11:12:01,933 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 11:12:01,934 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 11:12:01,935 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 11:12:01,935 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 11:12:01,936 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 11:12:01,936 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 11:12:01,937 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 11:12:01,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 11:12:01,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 11:12:01,938 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 11:12:01,939 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 11:12:01,939 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 11:12:01,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 11:12:01,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 11:12:01,941 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 11:12:01,959 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 11:12:01,959 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 11:12:01,960 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 11:12:01,960 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 11:12:01,960 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 11:12:01,960 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 11:12:01,961 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 11:12:01,961 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 11:12:01,961 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 11:12:01,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 11:12:01,962 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 11:12:01,962 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 11:12:01,962 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 11:12:01,962 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 11:12:01,962 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 11:12:01,962 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 11:12:01,963 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 11:12:01,963 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 11:12:01,963 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 11:12:01,963 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 11:12:01,963 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 11:12:01,963 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 11:12:01,964 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 11:12:01,964 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 11:12:01,964 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 11:12:01,964 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:12:01,964 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 11:12:01,964 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 11:12:01,964 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 11:12:01,965 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 11:12:01,965 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 11:12:01,965 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 11:12:01,965 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 11:12:01,965 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 11:12:01,965 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/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_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8 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 -> 3747e65f01c1fbd6eb9d2ad39b0ceed8be631bde45acb074c0903963e660faab [2022-12-13 11:12:02,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 11:12:02,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 11:12:02,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 11:12:02,178 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 11:12:02,179 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 11:12:02,179 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2022-12-13 11:12:04,701 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 11:12:04,883 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 11:12:04,883 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/sv-benchmarks/c/list-ext-properties/list-ext_flag.i [2022-12-13 11:12:04,891 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/data/0119b3eb8/f8129a2200b14681a6c26fa5be7a4378/FLAGd409cdb78 [2022-12-13 11:12:05,277 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/data/0119b3eb8/f8129a2200b14681a6c26fa5be7a4378 [2022-12-13 11:12:05,280 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 11:12:05,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 11:12:05,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 11:12:05,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 11:12:05,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 11:12:05,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,286 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d6ed6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05, skipping insertion in model container [2022-12-13 11:12:05,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 11:12:05,316 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 11:12:05,495 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/sv-benchmarks/c/list-ext-properties/list-ext_flag.i[23527,23540] [2022-12-13 11:12:05,497 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:12:05,504 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 11:12:05,532 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/sv-benchmarks/c/list-ext-properties/list-ext_flag.i[23527,23540] [2022-12-13 11:12:05,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 11:12:05,548 INFO L208 MainTranslator]: Completed translation [2022-12-13 11:12:05,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05 WrapperNode [2022-12-13 11:12:05,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 11:12:05,549 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 11:12:05,549 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 11:12:05,550 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 11:12:05,555 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,578 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2022-12-13 11:12:05,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 11:12:05,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 11:12:05,579 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 11:12:05,580 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 11:12:05,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,587 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,589 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,590 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,594 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,598 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 11:12:05,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 11:12:05,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 11:12:05,602 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 11:12:05,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (1/1) ... [2022-12-13 11:12:05,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 11:12:05,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:05,624 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 11:12:05,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-12-13 11:12:05,653 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 11:12:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 11:12:05,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 11:12:05,723 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 11:12:05,724 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 11:12:05,756 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-12-13 11:12:06,022 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 11:12:06,028 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 11:12:06,028 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-13 11:12:06,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:12:06 BoogieIcfgContainer [2022-12-13 11:12:06,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 11:12:06,032 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 11:12:06,032 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 11:12:06,034 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 11:12:06,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 11:12:05" (1/3) ... [2022-12-13 11:12:06,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502c7bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:12:06, skipping insertion in model container [2022-12-13 11:12:06,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 11:12:05" (2/3) ... [2022-12-13 11:12:06,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@502c7bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 11:12:06, skipping insertion in model container [2022-12-13 11:12:06,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:12:06" (3/3) ... [2022-12-13 11:12:06,037 INFO L112 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2022-12-13 11:12:06,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 11:12:06,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2022-12-13 11:12:06,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 11:12:06,089 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=PETRI_NET, 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;@6e5dfb9a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 11:12:06,089 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2022-12-13 11:12:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 55 states have (on average 2.109090909090909) internal successors, (116), 102 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 11:12:06,098 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:06,098 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 11:12:06,099 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:06,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:06,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-12-13 11:12:06,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:06,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132770532] [2022-12-13 11:12:06,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:06,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:06,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:06,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132770532] [2022-12-13 11:12:06,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132770532] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:06,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:06,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:12:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008155636] [2022-12-13 11:12:06,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:06,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:12:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:06,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:12:06,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:06,274 INFO L87 Difference]: Start difference. First operand has 104 states, 55 states have (on average 2.109090909090909) internal successors, (116), 102 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:06,375 INFO L93 Difference]: Finished difference Result 123 states and 135 transitions. [2022-12-13 11:12:06,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:12:06,377 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-13 11:12:06,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:06,382 INFO L225 Difference]: With dead ends: 123 [2022-12-13 11:12:06,382 INFO L226 Difference]: Without dead ends: 116 [2022-12-13 11:12:06,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:06,385 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 98 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:06,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 85 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:06,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-12-13 11:12:06,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2022-12-13 11:12:06,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 52 states have (on average 2.0) internal successors, (104), 95 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-12-13 11:12:06,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-12-13 11:12:06,409 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 4 [2022-12-13 11:12:06,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:06,410 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-12-13 11:12:06,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,410 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-12-13 11:12:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-13 11:12:06,410 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:06,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-13 11:12:06,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 11:12:06,411 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:06,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:06,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-12-13 11:12:06,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:06,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710873752] [2022-12-13 11:12:06,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:06,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:06,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:06,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710873752] [2022-12-13 11:12:06,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710873752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:06,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:06,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 11:12:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104936395] [2022-12-13 11:12:06,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:06,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 11:12:06,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:06,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 11:12:06,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:06,492 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:06,550 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2022-12-13 11:12:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 11:12:06,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-12-13 11:12:06,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:06,551 INFO L225 Difference]: With dead ends: 95 [2022-12-13 11:12:06,551 INFO L226 Difference]: Without dead ends: 95 [2022-12-13 11:12:06,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 11:12:06,553 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 99 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:06,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 65 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 11:12:06,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-12-13 11:12:06,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-12-13 11:12:06,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 52 states have (on average 1.9807692307692308) internal successors, (103), 94 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 103 transitions. [2022-12-13 11:12:06,560 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 103 transitions. Word has length 4 [2022-12-13 11:12:06,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:06,560 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 103 transitions. [2022-12-13 11:12:06,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,561 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 103 transitions. [2022-12-13 11:12:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 11:12:06,561 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:06,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:06,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 11:12:06,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:06,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:06,562 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304377, now seen corresponding path program 1 times [2022-12-13 11:12:06,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:06,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298074776] [2022-12-13 11:12:06,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:06,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:06,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:06,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:06,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298074776] [2022-12-13 11:12:06,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298074776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:06,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:06,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725649980] [2022-12-13 11:12:06,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:06,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:06,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:06,615 INFO L87 Difference]: Start difference. First operand 95 states and 103 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:06,728 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-12-13 11:12:06,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:12:06,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-13 11:12:06,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:06,730 INFO L225 Difference]: With dead ends: 105 [2022-12-13 11:12:06,730 INFO L226 Difference]: Without dead ends: 105 [2022-12-13 11:12:06,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:12:06,731 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 168 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:06,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 52 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:06,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-13 11:12:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2022-12-13 11:12:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 86 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-12-13 11:12:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 101 transitions. [2022-12-13 11:12:06,737 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 101 transitions. Word has length 9 [2022-12-13 11:12:06,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:06,738 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 101 transitions. [2022-12-13 11:12:06,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 101 transitions. [2022-12-13 11:12:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-13 11:12:06,738 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:06,739 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:06,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 11:12:06,739 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash 2065304378, now seen corresponding path program 1 times [2022-12-13 11:12:06,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:06,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604607751] [2022-12-13 11:12:06,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:06,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:06,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:06,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:06,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604607751] [2022-12-13 11:12:06,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604607751] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:06,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:06,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:06,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801541994] [2022-12-13 11:12:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:06,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:06,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:06,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:06,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:06,838 INFO L87 Difference]: Start difference. First operand 87 states and 101 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:06,971 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2022-12-13 11:12:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:06,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-13 11:12:06,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:06,972 INFO L225 Difference]: With dead ends: 123 [2022-12-13 11:12:06,972 INFO L226 Difference]: Without dead ends: 123 [2022-12-13 11:12:06,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:12:06,973 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 180 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:06,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 62 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-12-13 11:12:06,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 108. [2022-12-13 11:12:06,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 82 states have (on average 1.5121951219512195) internal successors, (124), 107 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2022-12-13 11:12:06,980 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 9 [2022-12-13 11:12:06,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:06,980 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2022-12-13 11:12:06,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:06,980 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2022-12-13 11:12:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 11:12:06,981 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:06,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:06,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 11:12:06,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash 990774777, now seen corresponding path program 1 times [2022-12-13 11:12:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:06,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302248204] [2022-12-13 11:12:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:06,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:07,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:07,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302248204] [2022-12-13 11:12:07,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302248204] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:07,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:07,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:12:07,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664245489] [2022-12-13 11:12:07,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:07,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:12:07,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:07,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:12:07,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:12:07,078 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:07,185 INFO L93 Difference]: Finished difference Result 156 states and 177 transitions. [2022-12-13 11:12:07,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:12:07,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 11:12:07,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:07,187 INFO L225 Difference]: With dead ends: 156 [2022-12-13 11:12:07,187 INFO L226 Difference]: Without dead ends: 156 [2022-12-13 11:12:07,188 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 11:12:07,188 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:07,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 250 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:07,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-12-13 11:12:07,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 113. [2022-12-13 11:12:07,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4942528735632183) internal successors, (130), 112 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 130 transitions. [2022-12-13 11:12:07,193 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 130 transitions. Word has length 15 [2022-12-13 11:12:07,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:07,194 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 130 transitions. [2022-12-13 11:12:07,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 130 transitions. [2022-12-13 11:12:07,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 11:12:07,194 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:07,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:07,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 11:12:07,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:07,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:07,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1321200184, now seen corresponding path program 1 times [2022-12-13 11:12:07,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:07,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909618555] [2022-12-13 11:12:07,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:07,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:07,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:07,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909618555] [2022-12-13 11:12:07,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909618555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:07,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:07,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 11:12:07,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123399826] [2022-12-13 11:12:07,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:07,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:12:07,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:07,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:12:07,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:12:07,283 INFO L87 Difference]: Start difference. First operand 113 states and 130 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:07,456 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2022-12-13 11:12:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:12:07,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-13 11:12:07,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:07,458 INFO L225 Difference]: With dead ends: 169 [2022-12-13 11:12:07,458 INFO L226 Difference]: Without dead ends: 169 [2022-12-13 11:12:07,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:12:07,459 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 145 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:07,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 221 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-12-13 11:12:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 113. [2022-12-13 11:12:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4827586206896552) internal successors, (129), 112 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2022-12-13 11:12:07,466 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 17 [2022-12-13 11:12:07,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:07,466 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2022-12-13 11:12:07,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,466 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2022-12-13 11:12:07,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 11:12:07,467 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:07,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:07,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 11:12:07,467 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:07,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:07,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1496225836, now seen corresponding path program 1 times [2022-12-13 11:12:07,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:07,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532864902] [2022-12-13 11:12:07,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:07,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:07,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:07,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532864902] [2022-12-13 11:12:07,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532864902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:07,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:07,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 11:12:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764458255] [2022-12-13 11:12:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:07,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 11:12:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:07,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 11:12:07,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 11:12:07,510 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:07,597 INFO L93 Difference]: Finished difference Result 122 states and 137 transitions. [2022-12-13 11:12:07,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 11:12:07,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 11:12:07,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:07,599 INFO L225 Difference]: With dead ends: 122 [2022-12-13 11:12:07,599 INFO L226 Difference]: Without dead ends: 122 [2022-12-13 11:12:07,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:12:07,600 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 157 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:07,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 84 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:07,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-13 11:12:07,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 114. [2022-12-13 11:12:07,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.4606741573033708) internal successors, (130), 113 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2022-12-13 11:12:07,605 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 19 [2022-12-13 11:12:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:07,605 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2022-12-13 11:12:07,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2022-12-13 11:12:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 11:12:07,606 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:07,606 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-12-13 11:12:07,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 11:12:07,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash 893457289, now seen corresponding path program 1 times [2022-12-13 11:12:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:07,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44196394] [2022-12-13 11:12:07,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:07,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:07,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44196394] [2022-12-13 11:12:07,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44196394] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:07,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:07,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 11:12:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748749976] [2022-12-13 11:12:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:07,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:12:07,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:07,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:12:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:12:07,684 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:07,810 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2022-12-13 11:12:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 11:12:07,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-12-13 11:12:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:07,812 INFO L225 Difference]: With dead ends: 151 [2022-12-13 11:12:07,812 INFO L226 Difference]: Without dead ends: 141 [2022-12-13 11:12:07,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:12:07,813 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 85 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:07,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 201 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-13 11:12:07,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2022-12-13 11:12:07,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 118 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2022-12-13 11:12:07,817 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 22 [2022-12-13 11:12:07,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:07,818 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2022-12-13 11:12:07,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2022-12-13 11:12:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 11:12:07,818 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:07,818 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] [2022-12-13 11:12:07,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 11:12:07,818 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:07,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608044, now seen corresponding path program 1 times [2022-12-13 11:12:07,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:07,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516346517] [2022-12-13 11:12:07,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:07,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:07,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:07,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:07,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516346517] [2022-12-13 11:12:07,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516346517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:07,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:07,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:12:07,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65707133] [2022-12-13 11:12:07,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:07,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:12:07,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:07,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:12:07,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:12:07,917 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-12-13 11:12:08,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:08,067 INFO L93 Difference]: Finished difference Result 120 states and 136 transitions. [2022-12-13 11:12:08,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:12:08,067 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-12-13 11:12:08,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:08,068 INFO L225 Difference]: With dead ends: 120 [2022-12-13 11:12:08,068 INFO L226 Difference]: Without dead ends: 120 [2022-12-13 11:12:08,068 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-12-13 11:12:08,069 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 119 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:08,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 185 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:08,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-12-13 11:12:08,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-12-13 11:12:08,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 94 states have (on average 1.4148936170212767) internal successors, (133), 116 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:08,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2022-12-13 11:12:08,073 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 22 [2022-12-13 11:12:08,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:08,073 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2022-12-13 11:12:08,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-12-13 11:12:08,073 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2022-12-13 11:12:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 11:12:08,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:08,074 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] [2022-12-13 11:12:08,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 11:12:08,074 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:08,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:08,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1991608043, now seen corresponding path program 1 times [2022-12-13 11:12:08,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:08,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600117557] [2022-12-13 11:12:08,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:08,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:08,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:08,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600117557] [2022-12-13 11:12:08,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600117557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:08,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:08,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:12:08,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122754210] [2022-12-13 11:12:08,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:08,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 11:12:08,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:08,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 11:12:08,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:12:08,243 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-12-13 11:12:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:08,448 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2022-12-13 11:12:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:12:08,449 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-12-13 11:12:08,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:08,449 INFO L225 Difference]: With dead ends: 117 [2022-12-13 11:12:08,449 INFO L226 Difference]: Without dead ends: 117 [2022-12-13 11:12:08,450 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-12-13 11:12:08,450 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:08,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 253 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:08,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-12-13 11:12:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 100. [2022-12-13 11:12:08,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.369047619047619) internal successors, (115), 99 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2022-12-13 11:12:08,453 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 22 [2022-12-13 11:12:08,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:08,453 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2022-12-13 11:12:08,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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-12-13 11:12:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2022-12-13 11:12:08,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 11:12:08,454 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:08,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:08,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 11:12:08,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:08,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:08,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1076428849, now seen corresponding path program 1 times [2022-12-13 11:12:08,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:08,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144240105] [2022-12-13 11:12:08,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:08,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:08,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:12:08,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:08,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144240105] [2022-12-13 11:12:08,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144240105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:08,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:08,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 11:12:08,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900012914] [2022-12-13 11:12:08,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:08,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 11:12:08,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:08,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 11:12:08,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 11:12:08,666 INFO L87 Difference]: Start difference. First operand 100 states and 115 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:08,839 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2022-12-13 11:12:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 11:12:08,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-12-13 11:12:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:08,840 INFO L225 Difference]: With dead ends: 107 [2022-12-13 11:12:08,840 INFO L226 Difference]: Without dead ends: 98 [2022-12-13 11:12:08,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:12:08,841 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 116 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:08,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 294 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-12-13 11:12:08,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 89. [2022-12-13 11:12:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 88 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 103 transitions. [2022-12-13 11:12:08,845 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 103 transitions. Word has length 25 [2022-12-13 11:12:08,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:08,845 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 103 transitions. [2022-12-13 11:12:08,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:08,845 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 103 transitions. [2022-12-13 11:12:08,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 11:12:08,846 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:08,846 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, 1, 1, 1, 1, 1] [2022-12-13 11:12:08,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 11:12:08,846 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:08,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:08,847 INFO L85 PathProgramCache]: Analyzing trace with hash 762143636, now seen corresponding path program 1 times [2022-12-13 11:12:08,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:08,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791862260] [2022-12-13 11:12:08,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:08,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:08,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:08,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791862260] [2022-12-13 11:12:08,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791862260] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:08,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [644770274] [2022-12-13 11:12:08,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:08,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:08,933 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:08,934 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:08,935 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 11:12:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:09,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 11:12:09,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:09,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:12:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:12:09,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 11:12:09,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [644770274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:09,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 11:12:09,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2022-12-13 11:12:09,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093752269] [2022-12-13 11:12:09,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:09,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 11:12:09,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:09,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 11:12:09,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-12-13 11:12:09,137 INFO L87 Difference]: Start difference. First operand 89 states and 103 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:09,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:09,244 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2022-12-13 11:12:09,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 11:12:09,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-12-13 11:12:09,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:09,245 INFO L225 Difference]: With dead ends: 140 [2022-12-13 11:12:09,245 INFO L226 Difference]: Without dead ends: 140 [2022-12-13 11:12:09,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-12-13 11:12:09,246 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 43 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:09,247 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 301 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-12-13 11:12:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 96. [2022-12-13 11:12:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3875) internal successors, (111), 95 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:09,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 111 transitions. [2022-12-13 11:12:09,249 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 111 transitions. Word has length 28 [2022-12-13 11:12:09,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:09,249 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 111 transitions. [2022-12-13 11:12:09,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 111 transitions. [2022-12-13 11:12:09,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 11:12:09,250 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:09,251 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:09,257 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 11:12:09,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:09,452 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:09,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1442202006, now seen corresponding path program 1 times [2022-12-13 11:12:09,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:09,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021005514] [2022-12-13 11:12:09,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:09,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:09,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021005514] [2022-12-13 11:12:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021005514] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481927867] [2022-12-13 11:12:09,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:09,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:09,633 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:09,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:09,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 11:12:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:09,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 11:12:09,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:09,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:09,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:09,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481927867] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:09,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:09,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2022-12-13 11:12:09,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453476444] [2022-12-13 11:12:09,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:09,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 11:12:09,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:09,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 11:12:09,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2022-12-13 11:12:09,772 INFO L87 Difference]: Start difference. First operand 96 states and 111 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:09,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:09,915 INFO L93 Difference]: Finished difference Result 324 states and 370 transitions. [2022-12-13 11:12:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 11:12:09,916 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 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-12-13 11:12:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:09,917 INFO L225 Difference]: With dead ends: 324 [2022-12-13 11:12:09,917 INFO L226 Difference]: Without dead ends: 324 [2022-12-13 11:12:09,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:12:09,917 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 210 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:09,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 501 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:09,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-12-13 11:12:09,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 137. [2022-12-13 11:12:09,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2022-12-13 11:12:09,921 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 28 [2022-12-13 11:12:09,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:09,921 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2022-12-13 11:12:09,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:09,922 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2022-12-13 11:12:09,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 11:12:09,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:09,922 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:09,927 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 11:12:10,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 11:12:10,123 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:10,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:10,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1992394589, now seen corresponding path program 1 times [2022-12-13 11:12:10,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:10,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866513553] [2022-12-13 11:12:10,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:10,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:10,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:10,348 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:10,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:10,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866513553] [2022-12-13 11:12:10,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866513553] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:10,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222900345] [2022-12-13 11:12:10,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:10,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:10,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:10,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:10,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 11:12:10,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:10,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 11:12:10,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:10,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:12:10,543 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:10,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:12:10,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:12:10,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:12:10,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:10,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-13 11:12:10,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:12:10,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:12:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:10,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:10,754 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_359 (Array Int Int))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_359) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-12-13 11:12:10,926 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:10,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-12-13 11:12:10,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:10,936 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:10,941 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:11,079 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:11,080 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 74 [2022-12-13 11:12:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 11:12:11,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222900345] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:11,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:11,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 29 [2022-12-13 11:12:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211657162] [2022-12-13 11:12:11,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:11,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-13 11:12:11,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:11,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-13 11:12:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=615, Unknown=10, NotChecked=52, Total=812 [2022-12-13 11:12:11,158 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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-12-13 11:12:11,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:11,961 INFO L93 Difference]: Finished difference Result 270 states and 299 transitions. [2022-12-13 11:12:11,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 11:12:11,961 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-13 11:12:11,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:11,962 INFO L225 Difference]: With dead ends: 270 [2022-12-13 11:12:11,962 INFO L226 Difference]: Without dead ends: 270 [2022-12-13 11:12:11,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=268, Invalid=985, Unknown=11, NotChecked=68, Total=1332 [2022-12-13 11:12:11,964 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 366 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 43 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:11,964 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 751 Invalid, 1214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 990 Invalid, 4 Unknown, 177 Unchecked, 0.6s Time] [2022-12-13 11:12:11,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-13 11:12:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 153. [2022-12-13 11:12:11,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 137 states have (on average 1.2846715328467153) internal successors, (176), 152 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 176 transitions. [2022-12-13 11:12:11,968 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 176 transitions. Word has length 30 [2022-12-13 11:12:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:11,969 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 176 transitions. [2022-12-13 11:12:11,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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-12-13 11:12:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 176 transitions. [2022-12-13 11:12:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 11:12:11,970 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:11,970 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:11,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 11:12:12,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 11:12:12,170 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:12,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:12,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1992702419, now seen corresponding path program 1 times [2022-12-13 11:12:12,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:12,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008104158] [2022-12-13 11:12:12,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:12,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:12,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:12,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008104158] [2022-12-13 11:12:12,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008104158] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:12,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296738196] [2022-12-13 11:12:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:12,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:12,607 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:12,608 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:12,609 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 11:12:12,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:12,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 37 conjunts are in the unsatisfiable core [2022-12-13 11:12:12,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:12,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:12,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:12:12,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:12:12,763 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:12,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:12:12,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:12,801 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-12-13 11:12:12,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 11:12:12,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:12:12,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:12:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:12,862 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:12,889 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-12-13 11:12:12,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int))) (= (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| 8)) v_ArrVal_436) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) 0)) is different from false [2022-12-13 11:12:13,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:13,135 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 41 [2022-12-13 11:12:13,144 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 11:12:13,145 INFO L350 Elim1Store]: Elim1 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 31 [2022-12-13 11:12:13,148 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:13,155 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 11:12:13,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 11:12:13,196 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 11:12:13,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296738196] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:13,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:13,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 26 [2022-12-13 11:12:13,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224829470] [2022-12-13 11:12:13,197 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:13,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 11:12:13,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:13,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 11:12:13,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=450, Unknown=9, NotChecked=90, Total=650 [2022-12-13 11:12:13,198 INFO L87 Difference]: Start difference. First operand 153 states and 176 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:18,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:18,611 INFO L93 Difference]: Finished difference Result 270 states and 301 transitions. [2022-12-13 11:12:18,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:12:18,611 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-13 11:12:18,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:18,612 INFO L225 Difference]: With dead ends: 270 [2022-12-13 11:12:18,612 INFO L226 Difference]: Without dead ends: 270 [2022-12-13 11:12:18,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=290, Invalid=1035, Unknown=15, NotChecked=142, Total=1482 [2022-12-13 11:12:18,613 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 445 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 965 mSolverCounterSat, 66 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 1306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 965 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 259 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:18,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 707 Invalid, 1306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 965 Invalid, 16 Unknown, 259 Unchecked, 0.8s Time] [2022-12-13 11:12:18,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-12-13 11:12:18,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 173. [2022-12-13 11:12:18,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 157 states have (on average 1.2611464968152866) internal successors, (198), 172 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:18,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2022-12-13 11:12:18,618 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 30 [2022-12-13 11:12:18,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:18,618 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2022-12-13 11:12:18,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 26 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:18,619 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2022-12-13 11:12:18,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 11:12:18,619 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:18,619 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:18,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 11:12:18,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 11:12:18,821 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:18,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:18,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1374608061, now seen corresponding path program 1 times [2022-12-13 11:12:18,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:18,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678321938] [2022-12-13 11:12:18,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:18,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:19,195 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:19,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:19,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678321938] [2022-12-13 11:12:19,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678321938] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:19,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478113995] [2022-12-13 11:12:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:19,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:19,196 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:19,197 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:19,197 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 11:12:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:19,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 11:12:19,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:19,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:19,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:12:19,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2022-12-13 11:12:19,438 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:19,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:12:19,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:19,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-12-13 11:12:19,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-13 11:12:19,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-12-13 11:12:19,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 11:12:19,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:19,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:20,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:20,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2022-12-13 11:12:20,265 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-12-13 11:12:20,265 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 33 [2022-12-13 11:12:20,271 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:20,278 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 11:12:20,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 11:12:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:20,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478113995] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:20,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:20,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 16] total 38 [2022-12-13 11:12:20,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8685236] [2022-12-13 11:12:20,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:20,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-12-13 11:12:20,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:20,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-12-13 11:12:20,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1176, Unknown=3, NotChecked=0, Total=1406 [2022-12-13 11:12:20,358 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:22,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:22,042 INFO L93 Difference]: Finished difference Result 295 states and 332 transitions. [2022-12-13 11:12:22,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 11:12:22,042 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-13 11:12:22,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:22,044 INFO L225 Difference]: With dead ends: 295 [2022-12-13 11:12:22,044 INFO L226 Difference]: Without dead ends: 295 [2022-12-13 11:12:22,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=449, Invalid=1804, Unknown=3, NotChecked=0, Total=2256 [2022-12-13 11:12:22,044 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 663 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 1415 mSolverCounterSat, 97 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1415 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:22,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 995 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1415 Invalid, 5 Unknown, 0 Unchecked, 1.3s Time] [2022-12-13 11:12:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-12-13 11:12:22,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 211. [2022-12-13 11:12:22,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 195 states have (on average 1.2461538461538462) internal successors, (243), 210 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:22,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 243 transitions. [2022-12-13 11:12:22,048 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 243 transitions. Word has length 30 [2022-12-13 11:12:22,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:22,048 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 243 transitions. [2022-12-13 11:12:22,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.026315789473684) internal successors, (77), 38 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:22,048 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 243 transitions. [2022-12-13 11:12:22,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 11:12:22,048 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:22,048 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, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:22,053 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 11:12:22,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 11:12:22,250 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:22,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:22,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1374915891, now seen corresponding path program 1 times [2022-12-13 11:12:22,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:22,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015063301] [2022-12-13 11:12:22,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:22,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:22,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:22,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015063301] [2022-12-13 11:12:22,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015063301] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:22,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981217520] [2022-12-13 11:12:22,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:22,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:22,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:22,506 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:22,506 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 11:12:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:22,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-13 11:12:22,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:22,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:12:22,715 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:22,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:12:22,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:12:22,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:12:22,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:22,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-13 11:12:22,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:12:22,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:12:22,904 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:22,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:22,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_588 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)) is different from false [2022-12-13 11:12:23,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2022-12-13 11:12:23,123 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:23,123 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 46 [2022-12-13 11:12:23,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 11:12:23,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981217520] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:23,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:23,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 28 [2022-12-13 11:12:23,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737881540] [2022-12-13 11:12:23,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:23,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 11:12:23,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:23,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 11:12:23,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=574, Unknown=1, NotChecked=50, Total=756 [2022-12-13 11:12:23,181 INFO L87 Difference]: Start difference. First operand 211 states and 243 transitions. Second operand has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 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-12-13 11:12:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:24,384 INFO L93 Difference]: Finished difference Result 341 states and 377 transitions. [2022-12-13 11:12:24,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 11:12:24,384 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-12-13 11:12:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:24,385 INFO L225 Difference]: With dead ends: 341 [2022-12-13 11:12:24,385 INFO L226 Difference]: Without dead ends: 341 [2022-12-13 11:12:24,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=384, Invalid=1340, Unknown=2, NotChecked=80, Total=1806 [2022-12-13 11:12:24,386 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 450 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 1597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 235 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:24,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 956 Invalid, 1597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1307 Invalid, 0 Unknown, 235 Unchecked, 0.8s Time] [2022-12-13 11:12:24,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2022-12-13 11:12:24,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 213. [2022-12-13 11:12:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 197 states have (on average 1.2436548223350254) internal successors, (245), 212 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 245 transitions. [2022-12-13 11:12:24,390 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 245 transitions. Word has length 30 [2022-12-13 11:12:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:24,390 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 245 transitions. [2022-12-13 11:12:24,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.6785714285714284) internal successors, (75), 28 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-12-13 11:12:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 245 transitions. [2022-12-13 11:12:24,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 11:12:24,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:24,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:24,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 11:12:24,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 11:12:24,593 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:24,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:24,594 INFO L85 PathProgramCache]: Analyzing trace with hash 864210937, now seen corresponding path program 1 times [2022-12-13 11:12:24,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:24,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527201588] [2022-12-13 11:12:24,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:24,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:24,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:24,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:24,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527201588] [2022-12-13 11:12:24,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527201588] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:24,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981033605] [2022-12-13 11:12:24,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:24,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:24,913 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:24,913 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:24,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 11:12:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:24,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 11:12:24,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:25,099 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:12:25,100 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:25,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:25,247 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:12:25,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-13 11:12:25,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 11:12:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:25,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:25,392 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-12-13 11:12:27,445 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (= (select |c_#valid| (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| 8)) v_ArrVal_660) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-12-13 11:12:27,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:27,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-12-13 11:12:27,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:27,455 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:27,457 INFO L350 Elim1Store]: Elim1 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 5 [2022-12-13 11:12:31,769 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:31,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 74 treesize of output 228 [2022-12-13 11:12:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 11:12:32,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981033605] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:32,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:32,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 32 [2022-12-13 11:12:32,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890026989] [2022-12-13 11:12:32,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:32,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 11:12:32,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:32,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 11:12:32,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=762, Unknown=5, NotChecked=118, Total=1056 [2022-12-13 11:12:32,863 INFO L87 Difference]: Start difference. First operand 213 states and 245 transitions. Second operand has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:33,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:33,516 INFO L93 Difference]: Finished difference Result 300 states and 337 transitions. [2022-12-13 11:12:33,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 11:12:33,516 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 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-12-13 11:12:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:33,517 INFO L225 Difference]: With dead ends: 300 [2022-12-13 11:12:33,517 INFO L226 Difference]: Without dead ends: 300 [2022-12-13 11:12:33,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 518 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=311, Invalid=1174, Unknown=5, NotChecked=150, Total=1640 [2022-12-13 11:12:33,517 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 656 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:33,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [656 Valid, 557 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 855 Invalid, 0 Unknown, 239 Unchecked, 0.4s Time] [2022-12-13 11:12:33,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2022-12-13 11:12:33,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 224. [2022-12-13 11:12:33,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 208 states have (on average 1.2403846153846154) internal successors, (258), 223 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:33,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 258 transitions. [2022-12-13 11:12:33,520 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 258 transitions. Word has length 32 [2022-12-13 11:12:33,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:33,520 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 258 transitions. [2022-12-13 11:12:33,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.78125) internal successors, (89), 33 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:33,521 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 258 transitions. [2022-12-13 11:12:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-12-13 11:12:33,521 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:33,521 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:33,525 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 11:12:33,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:33,722 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:33,722 INFO L85 PathProgramCache]: Analyzing trace with hash 864210938, now seen corresponding path program 1 times [2022-12-13 11:12:33,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:33,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77348107] [2022-12-13 11:12:33,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:33,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:34,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:34,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77348107] [2022-12-13 11:12:34,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77348107] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:34,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988479221] [2022-12-13 11:12:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:34,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:34,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:34,124 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:34,125 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 11:12:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:34,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 11:12:34,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:34,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 11:12:34,303 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:34,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:12:34,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:34,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:34,470 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:12:34,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-12-13 11:12:34,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 11:12:34,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 11:12:34,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:12:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:34,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:34,707 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_735 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_735) |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_734) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-12-13 11:12:34,726 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_735) |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~mem10#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) (forall ((v_ArrVal_735 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-12-13 11:12:34,735 WARN L837 $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| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_734) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))) (forall ((v_ArrVal_735 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_735) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))))) is different from false [2022-12-13 11:12:34,744 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:34,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-12-13 11:12:34,749 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:34,750 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2022-12-13 11:12:34,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:34,759 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:34,771 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:34,771 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:34,777 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 32 [2022-12-13 11:12:34,782 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 58 [2022-12-13 11:12:34,825 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:34,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-13 11:12:34,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:12:34,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:12:34,830 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 8 [2022-12-13 11:12:34,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:34,983 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 74 [2022-12-13 11:12:35,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 11:12:35,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988479221] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:35,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:35,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 34 [2022-12-13 11:12:35,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506806422] [2022-12-13 11:12:35,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:35,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-12-13 11:12:35,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:35,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-12-13 11:12:35,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=849, Unknown=3, NotChecked=186, Total=1190 [2022-12-13 11:12:35,149 INFO L87 Difference]: Start difference. First operand 224 states and 258 transitions. Second operand has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:36,430 INFO L93 Difference]: Finished difference Result 307 states and 348 transitions. [2022-12-13 11:12:36,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 11:12:36,430 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-12-13 11:12:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:36,432 INFO L225 Difference]: With dead ends: 307 [2022-12-13 11:12:36,432 INFO L226 Difference]: Without dead ends: 307 [2022-12-13 11:12:36,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=464, Invalid=1897, Unknown=3, NotChecked=288, Total=2652 [2022-12-13 11:12:36,432 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 875 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 1019 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 586 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:36,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 786 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1019 Invalid, 0 Unknown, 586 Unchecked, 0.6s Time] [2022-12-13 11:12:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-12-13 11:12:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 219. [2022-12-13 11:12:36,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 206 states have (on average 1.2233009708737863) internal successors, (252), 218 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 252 transitions. [2022-12-13 11:12:36,436 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 252 transitions. Word has length 32 [2022-12-13 11:12:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:36,436 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 252 transitions. [2022-12-13 11:12:36,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 252 transitions. [2022-12-13 11:12:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-12-13 11:12:36,436 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:36,436 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:36,441 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 11:12:36,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:36,638 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:36,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:36,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1554334094, now seen corresponding path program 1 times [2022-12-13 11:12:36,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:36,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521703964] [2022-12-13 11:12:36,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:36,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:36,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:36,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521703964] [2022-12-13 11:12:36,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521703964] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:36,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727870462] [2022-12-13 11:12:36,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:36,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:36,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:36,867 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:36,868 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 11:12:36,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:36,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 11:12:36,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:37,034 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:37,034 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:37,059 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:37,177 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:12:37,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-12-13 11:12:37,303 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:37,304 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:37,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:37,538 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_808) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)))) is different from false [2022-12-13 11:12:37,547 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_87| Int)) (or (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_87|) (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_87| 1) 0) (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| 8)) v_ArrVal_808) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |v_ULTIMATE.start_main_~p~0#1.offset_87| 8)) 0)))) is different from false [2022-12-13 11:12:37,555 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:37,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-12-13 11:12:37,562 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:37,563 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:37,566 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:37,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:37,822 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 52 [2022-12-13 11:12:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:37,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727870462] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:37,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:37,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 32 [2022-12-13 11:12:37,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615563537] [2022-12-13 11:12:37,896 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:37,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 11:12:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:37,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 11:12:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=774, Unknown=3, NotChecked=114, Total=992 [2022-12-13 11:12:37,897 INFO L87 Difference]: Start difference. First operand 219 states and 252 transitions. Second operand has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:39,657 INFO L93 Difference]: Finished difference Result 411 states and 461 transitions. [2022-12-13 11:12:39,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 11:12:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 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-12-13 11:12:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:39,658 INFO L225 Difference]: With dead ends: 411 [2022-12-13 11:12:39,658 INFO L226 Difference]: Without dead ends: 409 [2022-12-13 11:12:39,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=738, Invalid=3299, Unknown=3, NotChecked=250, Total=4290 [2022-12-13 11:12:39,659 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 1420 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 1653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 494 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:39,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 763 Invalid, 1653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 1003 Invalid, 0 Unknown, 494 Unchecked, 0.6s Time] [2022-12-13 11:12:39,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2022-12-13 11:12:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 245. [2022-12-13 11:12:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 232 states have (on average 1.25) internal successors, (290), 244 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 290 transitions. [2022-12-13 11:12:39,665 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 290 transitions. Word has length 35 [2022-12-13 11:12:39,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:39,665 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 290 transitions. [2022-12-13 11:12:39,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.78125) internal successors, (89), 32 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:39,665 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 290 transitions. [2022-12-13 11:12:39,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-12-13 11:12:39,666 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:39,666 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, 1, 1] [2022-12-13 11:12:39,670 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 11:12:39,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:39,867 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:39,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:39,868 INFO L85 PathProgramCache]: Analyzing trace with hash 357730772, now seen corresponding path program 1 times [2022-12-13 11:12:39,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:39,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833867372] [2022-12-13 11:12:39,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:39,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:39,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:12:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833867372] [2022-12-13 11:12:39,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833867372] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:39,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894293041] [2022-12-13 11:12:39,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:39,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:39,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:39,999 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:40,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 11:12:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:40,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-13 11:12:40,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:40,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:12:40,169 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:40,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:40,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894293041] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:40,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:40,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2022-12-13 11:12:40,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315361053] [2022-12-13 11:12:40,226 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:40,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 11:12:40,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:40,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 11:12:40,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-12-13 11:12:40,226 INFO L87 Difference]: Start difference. First operand 245 states and 290 transitions. Second operand has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:40,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:40,470 INFO L93 Difference]: Finished difference Result 566 states and 670 transitions. [2022-12-13 11:12:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 11:12:40,471 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-12-13 11:12:40,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:40,472 INFO L225 Difference]: With dead ends: 566 [2022-12-13 11:12:40,472 INFO L226 Difference]: Without dead ends: 566 [2022-12-13 11:12:40,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=224, Invalid=532, Unknown=0, NotChecked=0, Total=756 [2022-12-13 11:12:40,472 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 518 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:40,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 534 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-12-13 11:12:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 360. [2022-12-13 11:12:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 347 states have (on average 1.3227665706051874) internal successors, (459), 359 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 459 transitions. [2022-12-13 11:12:40,477 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 459 transitions. Word has length 36 [2022-12-13 11:12:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:40,477 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 459 transitions. [2022-12-13 11:12:40,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.3125) internal successors, (85), 16 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:40,478 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 459 transitions. [2022-12-13 11:12:40,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-13 11:12:40,478 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:40,478 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:40,482 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 11:12:40,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:40,678 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:40,679 INFO L85 PathProgramCache]: Analyzing trace with hash -929852094, now seen corresponding path program 1 times [2022-12-13 11:12:40,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:40,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345432475] [2022-12-13 11:12:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:40,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 11:12:40,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:40,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345432475] [2022-12-13 11:12:40,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345432475] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 11:12:40,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 11:12:40,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 11:12:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205289472] [2022-12-13 11:12:40,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 11:12:40,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 11:12:40,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:40,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 11:12:40,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 11:12:40,747 INFO L87 Difference]: Start difference. First operand 360 states and 459 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:40,839 INFO L93 Difference]: Finished difference Result 359 states and 457 transitions. [2022-12-13 11:12:40,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 11:12:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-12-13 11:12:40,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:40,840 INFO L225 Difference]: With dead ends: 359 [2022-12-13 11:12:40,840 INFO L226 Difference]: Without dead ends: 359 [2022-12-13 11:12:40,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 11:12:40,841 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 6 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:40,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 181 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 11:12:40,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-12-13 11:12:40,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 358. [2022-12-13 11:12:40,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 345 states have (on average 1.3217391304347825) internal successors, (456), 357 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 456 transitions. [2022-12-13 11:12:40,848 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 456 transitions. Word has length 37 [2022-12-13 11:12:40,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:40,848 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 456 transitions. [2022-12-13 11:12:40,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:40,848 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 456 transitions. [2022-12-13 11:12:40,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 11:12:40,848 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:40,848 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] [2022-12-13 11:12:40,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 11:12:40,848 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:40,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash 208867043, now seen corresponding path program 1 times [2022-12-13 11:12:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:40,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032493673] [2022-12-13 11:12:40,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:40,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:40,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:41,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:41,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032493673] [2022-12-13 11:12:41,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032493673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:41,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171729177] [2022-12-13 11:12:41,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:41,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:41,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:41,200 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:41,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 11:12:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:41,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-13 11:12:41,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:41,389 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:41,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:12:41,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:41,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:41,457 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:12:41,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-12-13 11:12:41,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-12-13 11:12:41,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-12-13 11:12:41,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-12-13 11:12:41,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-12-13 11:12:41,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:12:41,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:41,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:41,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 57 [2022-12-13 11:12:41,599 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_986 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.offset|)) (forall ((v_ArrVal_985 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_985) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) |c_ULTIMATE.start_main_~p~0#1.base|)))) is different from false [2022-12-13 11:12:41,620 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_985 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_985) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_986 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))))) is different from false [2022-12-13 11:12:41,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:41,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-13 11:12:41,677 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:41,677 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 31 [2022-12-13 11:12:41,679 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:41,691 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-12-13 11:12:41,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2022-12-13 11:12:41,835 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:41,836 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 74 [2022-12-13 11:12:41,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 11:12:41,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171729177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:41,947 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:41,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 28 [2022-12-13 11:12:41,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311585844] [2022-12-13 11:12:41,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:41,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 11:12:41,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:41,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 11:12:41,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=553, Unknown=5, NotChecked=98, Total=756 [2022-12-13 11:12:41,948 INFO L87 Difference]: Start difference. First operand 358 states and 456 transitions. Second operand has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:42,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:42,595 INFO L93 Difference]: Finished difference Result 357 states and 422 transitions. [2022-12-13 11:12:42,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 11:12:42,595 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-12-13 11:12:42,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:42,596 INFO L225 Difference]: With dead ends: 357 [2022-12-13 11:12:42,596 INFO L226 Difference]: Without dead ends: 357 [2022-12-13 11:12:42,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=240, Invalid=1023, Unknown=5, NotChecked=138, Total=1406 [2022-12-13 11:12:42,596 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 412 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 41 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:42,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 609 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 766 Invalid, 1 Unknown, 261 Unchecked, 0.4s Time] [2022-12-13 11:12:42,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2022-12-13 11:12:42,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 316. [2022-12-13 11:12:42,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 303 states have (on average 1.2607260726072607) internal successors, (382), 315 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 382 transitions. [2022-12-13 11:12:42,600 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 382 transitions. Word has length 38 [2022-12-13 11:12:42,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:42,600 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 382 transitions. [2022-12-13 11:12:42,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.0357142857142856) internal successors, (85), 28 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 382 transitions. [2022-12-13 11:12:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-12-13 11:12:42,600 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:42,600 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:42,605 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-13 11:12:42,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-12-13 11:12:42,802 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1693817782, now seen corresponding path program 1 times [2022-12-13 11:12:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:42,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625750122] [2022-12-13 11:12:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:42,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:43,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:12:43,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:43,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625750122] [2022-12-13 11:12:43,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625750122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:43,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916145643] [2022-12-13 11:12:43,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:43,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:43,027 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:43,028 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:43,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 11:12:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:43,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 11:12:43,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:43,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:12:43,247 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:43,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:12:43,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:43,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:12:43,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:12:43,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-13 11:12:43,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:12:43,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:12:43,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:12:43,440 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:43,733 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:43,733 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-12-13 11:12:43,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:43,741 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:43,744 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:43,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:43,853 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 74 [2022-12-13 11:12:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:12:43,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916145643] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:43,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:43,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 33 [2022-12-13 11:12:43,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119930080] [2022-12-13 11:12:43,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:43,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-12-13 11:12:43,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:43,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-12-13 11:12:43,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=877, Unknown=27, NotChecked=0, Total=1056 [2022-12-13 11:12:43,912 INFO L87 Difference]: Start difference. First operand 316 states and 382 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 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-12-13 11:12:47,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:12:47,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:47,898 INFO L93 Difference]: Finished difference Result 429 states and 493 transitions. [2022-12-13 11:12:47,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 11:12:47,898 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 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 38 [2022-12-13 11:12:47,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:47,899 INFO L225 Difference]: With dead ends: 429 [2022-12-13 11:12:47,899 INFO L226 Difference]: Without dead ends: 429 [2022-12-13 11:12:47,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=618, Invalid=2765, Unknown=39, NotChecked=0, Total=3422 [2022-12-13 11:12:47,900 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 469 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 64 mSolverCounterUnsat, 28 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 1761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 28 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:47,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 1167 Invalid, 1761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1669 Invalid, 28 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 11:12:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-12-13 11:12:47,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 316. [2022-12-13 11:12:47,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 303 states have (on average 1.2574257425742574) internal successors, (381), 315 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 381 transitions. [2022-12-13 11:12:47,904 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 381 transitions. Word has length 38 [2022-12-13 11:12:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:47,904 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 381 transitions. [2022-12-13 11:12:47,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 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-12-13 11:12:47,904 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 381 transitions. [2022-12-13 11:12:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 11:12:47,904 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:47,905 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:47,909 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 11:12:48,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-12-13 11:12:48,106 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:48,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:48,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1038799272, now seen corresponding path program 2 times [2022-12-13 11:12:48,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:48,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970105165] [2022-12-13 11:12:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:48,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:48,519 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:48,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:48,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970105165] [2022-12-13 11:12:48,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970105165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:48,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447371278] [2022-12-13 11:12:48,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:12:48,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:48,519 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:48,520 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:48,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 11:12:48,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:12:48,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:12:48,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 50 conjunts are in the unsatisfiable core [2022-12-13 11:12:48,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:48,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:12:48,745 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:48,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:12:48,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:48,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:12:48,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:12:48,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-13 11:12:48,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:12:48,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:12:48,949 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:12:48,950 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:48,991 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:48,996 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:49,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-13 11:12:49,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:12:49,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:12:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:49,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:49,164 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1184) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-12-13 11:12:49,173 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1184 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1184) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 2)) is different from false [2022-12-13 11:12:49,510 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:49,511 INFO L350 Elim1Store]: Elim1 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 49 treesize of output 89 [2022-12-13 11:12:49,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 156 [2022-12-13 11:12:49,838 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:49,838 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 74 [2022-12-13 11:12:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-13 11:12:49,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447371278] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:49,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:49,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 39 [2022-12-13 11:12:49,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295530227] [2022-12-13 11:12:49,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:49,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 11:12:49,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:49,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 11:12:49,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1139, Unknown=2, NotChecked=142, Total=1482 [2022-12-13 11:12:49,918 INFO L87 Difference]: Start difference. First operand 316 states and 381 transitions. Second operand has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:12:51,024 INFO L93 Difference]: Finished difference Result 472 states and 558 transitions. [2022-12-13 11:12:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-13 11:12:51,025 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-12-13 11:12:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:12:51,025 INFO L225 Difference]: With dead ends: 472 [2022-12-13 11:12:51,026 INFO L226 Difference]: Without dead ends: 472 [2022-12-13 11:12:51,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 759 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=452, Invalid=2003, Unknown=3, NotChecked=194, Total=2652 [2022-12-13 11:12:51,026 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 495 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1178 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 495 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 360 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:12:51,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [495 Valid, 858 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1178 Invalid, 0 Unknown, 360 Unchecked, 0.7s Time] [2022-12-13 11:12:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-12-13 11:12:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 316. [2022-12-13 11:12:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 303 states have (on average 1.2442244224422443) internal successors, (377), 315 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:51,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 377 transitions. [2022-12-13 11:12:51,030 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 377 transitions. Word has length 43 [2022-12-13 11:12:51,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:12:51,030 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 377 transitions. [2022-12-13 11:12:51,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.871794871794872) internal successors, (112), 39 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:12:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 377 transitions. [2022-12-13 11:12:51,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:12:51,030 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:12:51,030 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:12:51,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 11:12:51,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 11:12:51,232 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:12:51,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:12:51,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684670, now seen corresponding path program 2 times [2022-12-13 11:12:51,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:12:51,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071580126] [2022-12-13 11:12:51,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:12:51,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:12:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:12:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:51,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:12:51,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071580126] [2022-12-13 11:12:51,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071580126] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:12:51,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304656615] [2022-12-13 11:12:51,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:12:51,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:12:51,682 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:12:51,683 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:12:51,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 11:12:51,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:12:51,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:12:51,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 11:12:51,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:12:51,887 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:12:51,888 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:51,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:12:52,073 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:12:52,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-12-13 11:12:52,122 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:12:52,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-12-13 11:12:52,138 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-13 11:12:52,138 INFO L350 Elim1Store]: Elim1 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-12-13 11:12:52,187 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 11:12:52,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2022-12-13 11:12:52,352 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 11:12:52,352 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 59 [2022-12-13 11:12:52,476 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 11:12:52,477 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-12-13 11:12:52,480 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:12:52,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:12:54,636 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 1)) is different from false [2022-12-13 11:12:56,713 INFO L321 Elim1Store]: treesize reduction 5, result has 81.5 percent of original size [2022-12-13 11:12:56,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 30 [2022-12-13 11:12:56,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:56,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-12-13 11:12:56,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:56,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-13 11:12:56,991 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:56,991 INFO L350 Elim1Store]: Elim1 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 86 treesize of output 85 [2022-12-13 11:12:56,995 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 62 [2022-12-13 11:12:57,001 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:57,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 56 [2022-12-13 11:12:57,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:12:57,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-12-13 11:12:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-12-13 11:12:58,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304656615] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:12:58,634 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:12:58,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 42 [2022-12-13 11:12:58,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542063687] [2022-12-13 11:12:58,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:12:58,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-13 11:12:58,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:12:58,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-13 11:12:58,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1480, Unknown=15, NotChecked=80, Total=1806 [2022-12-13 11:12:58,637 INFO L87 Difference]: Start difference. First operand 316 states and 377 transitions. Second operand has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:00,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:13:02,826 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:13:04,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:13:06,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:13:09,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:13:11,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:13:12,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 11:13:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:13:14,295 INFO L93 Difference]: Finished difference Result 403 states and 477 transitions. [2022-12-13 11:13:14,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 11:13:14,295 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 0 states have call successors, (0), 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 45 [2022-12-13 11:13:14,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:13:14,296 INFO L225 Difference]: With dead ends: 403 [2022-12-13 11:13:14,296 INFO L226 Difference]: Without dead ends: 403 [2022-12-13 11:13:14,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=581, Invalid=2830, Unknown=15, NotChecked=114, Total=3540 [2022-12-13 11:13:14,297 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 526 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 2199 mSolverCounterSat, 67 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 2444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2199 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 171 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-12-13 11:13:14,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 1315 Invalid, 2444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2199 Invalid, 7 Unknown, 171 Unchecked, 15.1s Time] [2022-12-13 11:13:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-12-13 11:13:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 316. [2022-12-13 11:13:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 303 states have (on average 1.2409240924092408) internal successors, (376), 315 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 376 transitions. [2022-12-13 11:13:14,300 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 376 transitions. Word has length 45 [2022-12-13 11:13:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:13:14,300 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 376 transitions. [2022-12-13 11:13:14,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.8333333333333335) internal successors, (119), 43 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 376 transitions. [2022-12-13 11:13:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 11:13:14,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:13:14,301 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:14,306 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 11:13:14,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:14,502 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:13:14,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:14,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1853684671, now seen corresponding path program 2 times [2022-12-13 11:13:14,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:14,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487929441] [2022-12-13 11:13:14,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:14,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:14,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:15,078 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:15,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:15,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487929441] [2022-12-13 11:13:15,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487929441] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:15,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13250967] [2022-12-13 11:13:15,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:13:15,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:15,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:13:15,079 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:13:15,080 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 11:13:15,181 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:13:15,181 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:13:15,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 58 conjunts are in the unsatisfiable core [2022-12-13 11:13:15,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:15,293 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:13:15,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:13:15,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:13:15,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:13:15,487 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:13:15,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 11:13:15,493 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-13 11:13:15,505 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:15,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-12-13 11:13:15,579 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:13:15,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2022-12-13 11:13:15,582 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-13 11:13:15,595 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:15,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2022-12-13 11:13:15,658 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:13:15,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:13:15,734 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-13 11:13:15,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 26 [2022-12-13 11:13:15,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:13:15,745 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-12-13 11:13:16,000 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-13 11:13:16,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 71 [2022-12-13 11:13:16,007 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 11:13:16,019 INFO L350 Elim1Store]: Elim1 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 14 [2022-12-13 11:13:16,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 11:13:16,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:13:16,206 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:16,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:16,370 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1421 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1421) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (forall ((v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1420 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1421) |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_1420) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))))) is different from false [2022-12-13 11:13:16,492 WARN L837 $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| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (and (forall ((v_ArrVal_1421 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1421) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) (forall ((v_ArrVal_1421 (Array Int Int)) (v_ArrVal_1420 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1421) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1420) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)))))) is different from false [2022-12-13 11:13:16,505 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:16,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 67 [2022-12-13 11:13:16,816 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:16,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-12-13 11:13:17,384 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:17,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 100 [2022-12-13 11:13:17,392 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:17,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2022-12-13 11:13:17,404 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:17,404 INFO L350 Elim1Store]: Elim1 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 178 treesize of output 171 [2022-12-13 11:13:17,411 INFO L350 Elim1Store]: Elim1 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 155 treesize of output 151 [2022-12-13 11:13:17,416 INFO L350 Elim1Store]: Elim1 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 151 treesize of output 143 [2022-12-13 11:13:17,420 INFO L350 Elim1Store]: Elim1 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 143 treesize of output 139 [2022-12-13 11:13:17,425 INFO L350 Elim1Store]: Elim1 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 139 treesize of output 131 [2022-12-13 11:13:17,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:17,438 INFO L350 Elim1Store]: Elim1 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 276 treesize of output 269 [2022-12-13 11:13:17,447 INFO L350 Elim1Store]: Elim1 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 253 treesize of output 237 [2022-12-13 11:13:17,458 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:17,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 237 treesize of output 210 [2022-12-13 11:13:17,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:17,488 INFO L350 Elim1Store]: Elim1 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 208 treesize of output 248 [2022-12-13 11:13:18,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:18,310 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 74 [2022-12-13 11:13:18,391 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-13 11:13:18,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13250967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:13:18,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:13:18,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 45 [2022-12-13 11:13:18,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379699818] [2022-12-13 11:13:18,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:13:18,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 11:13:18,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:18,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 11:13:18,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1700, Unknown=29, NotChecked=170, Total=2070 [2022-12-13 11:13:18,394 INFO L87 Difference]: Start difference. First operand 316 states and 376 transitions. Second operand has 46 states, 45 states have (on average 2.8) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:25,319 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 89 DAG size of output: 40 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:13:27,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:13:27,728 INFO L93 Difference]: Finished difference Result 399 states and 470 transitions. [2022-12-13 11:13:27,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 11:13:27,729 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 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 45 [2022-12-13 11:13:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:13:27,729 INFO L225 Difference]: With dead ends: 399 [2022-12-13 11:13:27,729 INFO L226 Difference]: Without dead ends: 399 [2022-12-13 11:13:27,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 60 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=566, Invalid=3703, Unknown=29, NotChecked=258, Total=4556 [2022-12-13 11:13:27,730 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 640 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 1815 mSolverCounterSat, 107 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 640 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1815 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 322 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:13:27,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [640 Valid, 1294 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1815 Invalid, 2 Unknown, 322 Unchecked, 1.6s Time] [2022-12-13 11:13:27,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-12-13 11:13:27,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 313. [2022-12-13 11:13:27,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 300 states have (on average 1.23) internal successors, (369), 312 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:27,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 369 transitions. [2022-12-13 11:13:27,733 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 369 transitions. Word has length 45 [2022-12-13 11:13:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:13:27,733 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 369 transitions. [2022-12-13 11:13:27,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8) internal successors, (126), 46 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:27,734 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 369 transitions. [2022-12-13 11:13:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 11:13:27,734 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:13:27,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:27,738 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 11:13:27,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 11:13:27,935 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:13:27,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:27,936 INFO L85 PathProgramCache]: Analyzing trace with hash -63394326, now seen corresponding path program 1 times [2022-12-13 11:13:27,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:27,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360904366] [2022-12-13 11:13:27,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:27,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:28,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:28,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360904366] [2022-12-13 11:13:28,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360904366] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:28,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416757316] [2022-12-13 11:13:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:28,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:28,286 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:13:28,287 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:13:28,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 11:13:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:28,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 11:13:28,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:28,527 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:13:28,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:13:28,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:13:28,729 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:28,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-12-13 11:13:29,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:13:29,137 INFO L321 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-12-13 11:13:29,137 INFO L350 Elim1Store]: Elim1 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 29 treesize of output 24 [2022-12-13 11:13:29,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-13 11:13:29,319 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:29,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:29,585 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:29,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-12-13 11:13:29,888 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1494 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|))) (forall ((v_ArrVal_1494 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~a~0#1.base|))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse0 8))))) is different from false [2022-12-13 11:13:29,898 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_ArrVal_1494 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1494) |c_ULTIMATE.start_main_~a~0#1.base|))) (= (select .cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse0 8)))) (forall ((v_ArrVal_1494 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1494) |c_ULTIMATE.start_main_~a~0#1.base|) 8) |c_ULTIMATE.start_main_~a~0#1.base|))))) is different from false [2022-12-13 11:13:29,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:29,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2022-12-13 11:13:29,940 INFO L321 Elim1Store]: treesize reduction 5, result has 83.9 percent of original size [2022-12-13 11:13:29,941 INFO L350 Elim1Store]: Elim1 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 42 treesize of output 51 [2022-12-13 11:13:29,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:13:29,965 INFO L350 Elim1Store]: Elim1 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 9 treesize of output 3 [2022-12-13 11:13:29,969 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:29,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-12-13 11:13:29,978 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:29,978 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 36 [2022-12-13 11:13:29,982 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 18 [2022-12-13 11:13:30,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:30,315 INFO L350 Elim1Store]: Elim1 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 38 treesize of output 78 [2022-12-13 11:13:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:30,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416757316] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:13:30,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:13:30,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 19, 20] total 45 [2022-12-13 11:13:30,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796633095] [2022-12-13 11:13:30,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:13:30,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 11:13:30,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:30,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 11:13:30,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1723, Unknown=7, NotChecked=170, Total=2070 [2022-12-13 11:13:30,481 INFO L87 Difference]: Start difference. First operand 313 states and 369 transitions. Second operand has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 46 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:33,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:13:33,086 INFO L93 Difference]: Finished difference Result 372 states and 428 transitions. [2022-12-13 11:13:33,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 11:13:33,086 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 46 states have internal predecessors, (129), 0 states have call successors, (0), 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 46 [2022-12-13 11:13:33,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:13:33,088 INFO L225 Difference]: With dead ends: 372 [2022-12-13 11:13:33,089 INFO L226 Difference]: Without dead ends: 372 [2022-12-13 11:13:33,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 2 IntricatePredicates, 4 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=639, Invalid=3647, Unknown=12, NotChecked=258, Total=4556 [2022-12-13 11:13:33,091 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 560 mSDsluCounter, 967 mSDsCounter, 0 mSdLazyCounter, 1585 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 560 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 321 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 11:13:33,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [560 Valid, 1015 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1585 Invalid, 0 Unknown, 321 Unchecked, 1.4s Time] [2022-12-13 11:13:33,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-12-13 11:13:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 321. [2022-12-13 11:13:33,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 308 states have (on average 1.2272727272727273) internal successors, (378), 320 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:33,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 378 transitions. [2022-12-13 11:13:33,097 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 378 transitions. Word has length 46 [2022-12-13 11:13:33,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:13:33,097 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 378 transitions. [2022-12-13 11:13:33,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 46 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:33,097 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 378 transitions. [2022-12-13 11:13:33,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 11:13:33,097 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:13:33,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:33,102 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 11:13:33,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 11:13:33,299 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:13:33,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:33,300 INFO L85 PathProgramCache]: Analyzing trace with hash -63394325, now seen corresponding path program 1 times [2022-12-13 11:13:33,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:33,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117369372] [2022-12-13 11:13:33,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:33,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:33,858 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:33,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117369372] [2022-12-13 11:13:33,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117369372] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:33,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059745390] [2022-12-13 11:13:33,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:33,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:33,858 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:13:33,859 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:13:33,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 11:13:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:33,950 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-13 11:13:33,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:34,019 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:13:34,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:13:34,025 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:34,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:13:34,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:13:34,170 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:34,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-12-13 11:13:34,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 11:13:34,342 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:34,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2022-12-13 11:13:34,349 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:34,349 INFO L350 Elim1Store]: Elim1 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 21 [2022-12-13 11:13:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 11:13:34,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:34,911 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1572 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1571) |c_ULTIMATE.start_main_~a~0#1.base|) 8)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1572) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_1571 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1571) |c_ULTIMATE.start_main_~a~0#1.base|) 8))))) is different from false [2022-12-13 11:13:34,922 WARN L837 $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| 8)))) (and (forall ((v_ArrVal_1572 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1571) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1572) |c_ULTIMATE.start_main_~a~0#1.base|) 8)))) (forall ((v_ArrVal_1571 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1571) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 8))))) is different from false [2022-12-13 11:13:34,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:34,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-12-13 11:13:34,936 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:34,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-12-13 11:13:34,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:34,947 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:34,959 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:34,960 INFO L350 Elim1Store]: Elim1 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 84 treesize of output 81 [2022-12-13 11:13:34,965 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:34,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2022-12-13 11:13:35,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:35,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-13 11:13:35,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:13:35,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:13:35,018 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 10 [2022-12-13 11:13:35,206 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:35,206 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 74 [2022-12-13 11:13:35,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 11:13:35,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059745390] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:13:35,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:13:35,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 15] total 40 [2022-12-13 11:13:35,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154859405] [2022-12-13 11:13:35,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:13:35,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-13 11:13:35,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:35,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-13 11:13:35,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1299, Unknown=17, NotChecked=150, Total=1640 [2022-12-13 11:13:35,262 INFO L87 Difference]: Start difference. First operand 321 states and 378 transitions. Second operand has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:37,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:13:37,383 INFO L93 Difference]: Finished difference Result 369 states and 424 transitions. [2022-12-13 11:13:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 11:13:37,383 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-12-13 11:13:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:13:37,384 INFO L225 Difference]: With dead ends: 369 [2022-12-13 11:13:37,384 INFO L226 Difference]: Without dead ends: 369 [2022-12-13 11:13:37,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=749, Invalid=3660, Unknown=21, NotChecked=262, Total=4692 [2022-12-13 11:13:37,385 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 741 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:13:37,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 653 Invalid, 1513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1153 Invalid, 0 Unknown, 271 Unchecked, 0.8s Time] [2022-12-13 11:13:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-12-13 11:13:37,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 325. [2022-12-13 11:13:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 313 states have (on average 1.220447284345048) internal successors, (382), 324 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 382 transitions. [2022-12-13 11:13:37,388 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 382 transitions. Word has length 46 [2022-12-13 11:13:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:13:37,388 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 382 transitions. [2022-12-13 11:13:37,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.1) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 382 transitions. [2022-12-13 11:13:37,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-13 11:13:37,388 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:13:37,389 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:37,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 11:13:37,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 11:13:37,590 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:13:37,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:37,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1689205847, now seen corresponding path program 2 times [2022-12-13 11:13:37,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:37,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127085457] [2022-12-13 11:13:37,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:37,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:37,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:38,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:38,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127085457] [2022-12-13 11:13:38,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127085457] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:38,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628879303] [2022-12-13 11:13:38,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:13:38,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:38,026 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:13:38,027 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:13:38,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 11:13:38,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:13:38,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:13:38,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-13 11:13:38,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:38,235 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:13:38,236 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:38,278 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:38,447 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:38,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2022-12-13 11:13:38,507 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:38,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2022-12-13 11:13:38,525 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:13:38,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:13:38,589 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-13 11:13:38,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 30 [2022-12-13 11:13:38,818 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-13 11:13:38,819 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 58 [2022-12-13 11:13:38,826 INFO L350 Elim1Store]: Elim1 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 14 [2022-12-13 11:13:39,027 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:39,028 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:39,126 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:39,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:39,760 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:39,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-12-13 11:13:40,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:40,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-12-13 11:13:40,104 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:40,104 INFO L350 Elim1Store]: Elim1 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 173 treesize of output 166 [2022-12-13 11:13:40,110 INFO L350 Elim1Store]: Elim1 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 150 treesize of output 134 [2022-12-13 11:13:40,119 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:40,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 117 [2022-12-13 11:13:40,131 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 11:13:40,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 11:13:40,587 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:40,588 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 52 [2022-12-13 11:13:40,708 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:40,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628879303] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:13:40,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:13:40,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 45 [2022-12-13 11:13:40,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863047658] [2022-12-13 11:13:40,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:13:40,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 11:13:40,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:40,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 11:13:40,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1791, Unknown=25, NotChecked=0, Total=1980 [2022-12-13 11:13:40,711 INFO L87 Difference]: Start difference. First operand 325 states and 382 transitions. Second operand has 45 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 45 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:45,182 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_39|) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |v_ULTIMATE.start_main_~t~0#1.base_39|)) |v_ULTIMATE.start_main_~t~0#1.base_39| v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)))))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2022-12-13 11:13:46,012 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (and (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse0 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select .cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)))) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|))))) is different from false [2022-12-13 11:13:46,075 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (<= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((v_arrayElimArr_22 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_143| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_22 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_143|)))) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_22) .cse1 v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)) 0)) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= (select |c_#valid| .cse1) 0))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_39|) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |v_ULTIMATE.start_main_~t~0#1.base_39|)) |v_ULTIMATE.start_main_~t~0#1.base_39| v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)))) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|)))))) is different from false [2022-12-13 11:13:46,604 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_22 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (let ((.cse0 (select v_arrayElimArr_22 (+ |ULTIMATE.start_main_~p~0#1.offset| 8)))) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (not (= (select |c_#valid| .cse0) 0)) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_arrayElimArr_22) .cse0 v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)) 0))))) (forall ((v_ArrVal_1689 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) 0)) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|)))) is different from false [2022-12-13 11:13:48,331 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|))) (let ((.cse0 (select .cse2 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)))) (and (forall ((v_arrayElimArr_22 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_143| Int) (|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_22 (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_143|)))) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_22) .cse1 v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)) 0)) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= (select |c_#valid| .cse1) 0))))) (forall ((|v_ULTIMATE.start_main_~t~0#1.base_39| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~t~0#1.base_39|) 0)) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |v_ULTIMATE.start_main_~t~0#1.base_39|)) |v_ULTIMATE.start_main_~t~0#1.base_39| v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)) 0)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|) (not (= 0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| (store .cse2 (+ |ULTIMATE.start_main_~p~0#1.offset| 8) |c_ULTIMATE.start_main_~t~0#1.base|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)))))) (forall ((|v_ULTIMATE.start_main_~p~0#1.offset_141| Int) (v_ArrVal_1689 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_141| 1) 0) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1689) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_141|)))) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_141|))) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base|) |c_ULTIMATE.start_main_~p~0#1.offset|))))) is different from false [2022-12-13 11:13:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:13:48,935 INFO L93 Difference]: Finished difference Result 663 states and 767 transitions. [2022-12-13 11:13:48,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-13 11:13:48,935 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 45 states have internal predecessors, (128), 0 states have call successors, (0), 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 48 [2022-12-13 11:13:48,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:13:48,936 INFO L225 Difference]: With dead ends: 663 [2022-12-13 11:13:48,936 INFO L226 Difference]: Without dead ends: 660 [2022-12-13 11:13:48,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 111 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2982 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1569, Invalid=9954, Unknown=53, NotChecked=1080, Total=12656 [2022-12-13 11:13:48,937 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 1163 mSDsluCounter, 1365 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 299 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1163 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 2317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-12-13 11:13:48,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1163 Valid, 1426 Invalid, 2317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 1945 Invalid, 44 Unknown, 29 Unchecked, 2.6s Time] [2022-12-13 11:13:48,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2022-12-13 11:13:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 397. [2022-12-13 11:13:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 385 states have (on average 1.2233766233766235) internal successors, (471), 396 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:48,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 471 transitions. [2022-12-13 11:13:48,941 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 471 transitions. Word has length 48 [2022-12-13 11:13:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:13:48,942 INFO L495 AbstractCegarLoop]: Abstraction has 397 states and 471 transitions. [2022-12-13 11:13:48,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8444444444444446) internal successors, (128), 45 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:48,942 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 471 transitions. [2022-12-13 11:13:48,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 11:13:48,942 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:13:48,942 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:48,947 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 11:13:49,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:49,143 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:13:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:49,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1205371029, now seen corresponding path program 1 times [2022-12-13 11:13:49,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:49,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055271183] [2022-12-13 11:13:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:49,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:49,435 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:49,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:49,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055271183] [2022-12-13 11:13:49,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055271183] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:49,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064196285] [2022-12-13 11:13:49,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:49,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:49,436 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:13:49,437 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:13:49,438 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 11:13:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:49,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2022-12-13 11:13:49,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:49,672 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:13:49,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:13:49,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:13:49,850 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:49,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-12-13 11:13:50,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:50,075 INFO L350 Elim1Store]: Elim1 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 19 [2022-12-13 11:13:50,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 11:13:50,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:50,578 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1762 (Array Int Int)) (|ULTIMATE.start_main_~p~0#1.offset| Int)) (or (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 1) 0) (<= 1 |ULTIMATE.start_main_~p~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~p~0#1.offset| 8)) |c_#StackHeapBarrier|))) is different from false [2022-12-13 11:13:50,590 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1762 (Array Int Int)) (|v_ULTIMATE.start_main_~p~0#1.offset_155| Int)) (or (<= (+ |v_ULTIMATE.start_main_~p~0#1.offset_155| 1) 0) (< (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| 8)) v_ArrVal_1762) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |v_ULTIMATE.start_main_~p~0#1.offset_155|)) |c_#StackHeapBarrier|) (<= 1 |v_ULTIMATE.start_main_~p~0#1.offset_155|))) is different from false [2022-12-13 11:13:50,598 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:50,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-12-13 11:13:50,607 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:50,607 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:50,611 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:50,862 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:50,862 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 46 [2022-12-13 11:13:50,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 11:13:50,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064196285] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:13:50,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:13:50,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 33 [2022-12-13 11:13:50,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224186610] [2022-12-13 11:13:50,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:13:50,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-13 11:13:50,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:13:50,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-13 11:13:50,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=883, Unknown=9, NotChecked=122, Total=1122 [2022-12-13 11:13:50,933 INFO L87 Difference]: Start difference. First operand 397 states and 471 transitions. Second operand has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:13:52,855 INFO L93 Difference]: Finished difference Result 451 states and 524 transitions. [2022-12-13 11:13:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-12-13 11:13:52,855 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-12-13 11:13:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:13:52,856 INFO L225 Difference]: With dead ends: 451 [2022-12-13 11:13:52,856 INFO L226 Difference]: Without dead ends: 451 [2022-12-13 11:13:52,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 71 SyntacticMatches, 6 SemanticMatches, 59 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=585, Invalid=2833, Unknown=12, NotChecked=230, Total=3660 [2022-12-13 11:13:52,857 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 983 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 293 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-12-13 11:13:52,857 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 715 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1009 Invalid, 0 Unknown, 293 Unchecked, 0.8s Time] [2022-12-13 11:13:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-12-13 11:13:52,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 395. [2022-12-13 11:13:52,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 383 states have (on average 1.2245430809399478) internal successors, (469), 394 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 469 transitions. [2022-12-13 11:13:52,860 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 469 transitions. Word has length 49 [2022-12-13 11:13:52,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:13:52,861 INFO L495 AbstractCegarLoop]: Abstraction has 395 states and 469 transitions. [2022-12-13 11:13:52,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.787878787878788) internal successors, (125), 34 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:13:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 469 transitions. [2022-12-13 11:13:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 11:13:52,861 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:13:52,861 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:13:52,866 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 11:13:53,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:53,062 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:13:53,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:13:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash 84710120, now seen corresponding path program 2 times [2022-12-13 11:13:53,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:13:53,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126443894] [2022-12-13 11:13:53,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:13:53,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:13:53,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:13:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:13:53,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126443894] [2022-12-13 11:13:53,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126443894] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:13:53,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563478871] [2022-12-13 11:13:53,842 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 11:13:53,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:13:53,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:13:53,843 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:13:53,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 11:13:53,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 11:13:53,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 11:13:53,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 71 conjunts are in the unsatisfiable core [2022-12-13 11:13:53,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:13:54,029 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:13:54,029 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:54,036 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:54,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:13:54,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:13:54,259 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:13:54,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 11:13:54,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 11:13:54,276 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:54,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-12-13 11:13:54,356 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:13:54,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 11:13:54,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 11:13:54,372 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:54,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 36 [2022-12-13 11:13:54,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:13:54,461 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 11:13:54,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 26 [2022-12-13 11:13:54,485 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-13 11:13:54,485 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:54,562 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:13:54,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 11:13:54,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 11:13:54,581 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 11:13:54,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 33 [2022-12-13 11:13:54,596 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:54,849 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 11:13:54,850 INFO L350 Elim1Store]: Elim1 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 133 treesize of output 112 [2022-12-13 11:13:54,864 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:13:54,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 98 [2022-12-13 11:13:54,873 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 38 [2022-12-13 11:13:55,079 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 11:13:55,080 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 35 [2022-12-13 11:13:55,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-12-13 11:13:55,162 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:55,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:13:55,209 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:13:55,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:13:55,366 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1891 (Array Int Int)) (v_ArrVal_1890 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1891) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (not (<= (+ .cse0 8) (select |c_#length| .cse1))) (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_1890) .cse1) .cse0)))))) is different from false [2022-12-13 11:13:55,399 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1891 (Array Int Int)) (v_ArrVal_1890 (Array Int Int))) (let ((.cse2 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1891) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2)) (.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1889) |c_ULTIMATE.start_main_~a~0#1.base|) .cse2))) (or (= 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1890) .cse0) .cse1)) (not (<= (+ 8 .cse1) (select |c_#length| .cse0))))))) is different from false [2022-12-13 11:13:55,414 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1889 (Array Int Int)) (v_ArrVal_1891 (Array Int Int)) (v_ArrVal_1890 (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| 8))) (.cse3 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1889) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3)) (.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1891) |c_ULTIMATE.start_main_~a~0#1.base|) .cse3))) (or (not (<= (+ .cse0 8) (select |c_#length| .cse1))) (= 2 (select (select (store |c_#memory_int| .cse2 v_ArrVal_1890) .cse1) .cse0)))))) is different from false [2022-12-13 11:13:55,602 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:55,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 91 [2022-12-13 11:13:55,612 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:55,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 65 [2022-12-13 11:13:55,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:55,629 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:55,635 INFO L350 Elim1Store]: Elim1 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-12-13 11:13:56,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:56,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 288 [2022-12-13 11:13:56,931 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:56,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 277 treesize of output 248 [2022-12-13 11:13:56,950 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:56,950 INFO L350 Elim1Store]: Elim1 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 1641 treesize of output 1148 [2022-12-13 11:13:56,976 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:56,977 INFO L350 Elim1Store]: Elim1 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 4493 treesize of output 4312 [2022-12-13 11:13:57,021 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:57,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4296 treesize of output 4105 [2022-12-13 11:13:57,040 INFO L350 Elim1Store]: Elim1 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 4096 treesize of output 4080 [2022-12-13 11:13:57,063 INFO L350 Elim1Store]: Elim1 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 4080 treesize of output 4040 [2022-12-13 11:13:57,096 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:57,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4040 treesize of output 3477 [2022-12-13 11:13:57,116 INFO L350 Elim1Store]: Elim1 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 3468 treesize of output 3404 [2022-12-13 11:13:57,135 INFO L350 Elim1Store]: Elim1 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 3404 treesize of output 3260 [2022-12-13 11:13:57,154 INFO L350 Elim1Store]: Elim1 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 3260 treesize of output 3132 [2022-12-13 11:13:57,192 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:13:57,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3132 treesize of output 2801 [2022-12-13 11:13:57,212 INFO L350 Elim1Store]: Elim1 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 2792 treesize of output 2752 [2022-12-13 11:13:57,232 INFO L350 Elim1Store]: Elim1 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 2752 treesize of output 2688 [2022-12-13 11:13:57,253 INFO L350 Elim1Store]: Elim1 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 2688 treesize of output 2608 [2022-12-13 11:13:57,278 INFO L350 Elim1Store]: Elim1 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 2608 treesize of output 2576 [2022-12-13 11:14:00,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:00,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-12-13 11:14:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-12-13 11:14:01,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563478871] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:01,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:01,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 19] total 48 [2022-12-13 11:14:01,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33923521] [2022-12-13 11:14:01,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:01,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-13 11:14:01,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:01,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-13 11:14:01,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=1776, Unknown=5, NotChecked=264, Total=2256 [2022-12-13 11:14:01,256 INFO L87 Difference]: Start difference. First operand 395 states and 469 transitions. Second operand has 48 states, 48 states have (on average 2.7708333333333335) internal successors, (133), 48 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:09,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:14:11,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-13 11:14:14,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:14,582 INFO L93 Difference]: Finished difference Result 601 states and 700 transitions. [2022-12-13 11:14:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-12-13 11:14:14,583 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.7708333333333335) internal successors, (133), 48 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-12-13 11:14:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:14,584 INFO L225 Difference]: With dead ends: 601 [2022-12-13 11:14:14,584 INFO L226 Difference]: Without dead ends: 601 [2022-12-13 11:14:14,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1123 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=495, Invalid=3413, Unknown=10, NotChecked=372, Total=4290 [2022-12-13 11:14:14,584 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 451 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 69 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 2186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:14,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 1088 Invalid, 2186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1512 Invalid, 23 Unknown, 582 Unchecked, 9.5s Time] [2022-12-13 11:14:14,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-12-13 11:14:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 431. [2022-12-13 11:14:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 419 states have (on average 1.2147971360381862) internal successors, (509), 430 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 509 transitions. [2022-12-13 11:14:14,589 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 509 transitions. Word has length 51 [2022-12-13 11:14:14,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:14,589 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 509 transitions. [2022-12-13 11:14:14,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.7708333333333335) internal successors, (133), 48 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:14,590 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 509 transitions. [2022-12-13 11:14:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 11:14:14,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:14,590 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:14,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-12-13 11:14:14,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-12-13 11:14:14,792 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:14:14,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:14,792 INFO L85 PathProgramCache]: Analyzing trace with hash 84402290, now seen corresponding path program 1 times [2022-12-13 11:14:14,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:14,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073973235] [2022-12-13 11:14:14,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:14,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:16,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:16,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073973235] [2022-12-13 11:14:16,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073973235] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:16,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679347577] [2022-12-13 11:14:16,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:16,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:16,198 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:14:16,199 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:16,199 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 11:14:16,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:16,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 11:14:16,348 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:16,422 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:14:16,422 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:16,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:14:16,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:14:16,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 11:14:16,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 11:14:16,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:14:16,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:14:16,777 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:16,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 11:14:16,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 11:14:16,839 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 11:14:16,839 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:16,884 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-12-13 11:14:16,895 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 18 [2022-12-13 11:14:16,903 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-12-13 11:14:17,122 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 11:14:17,123 INFO L350 Elim1Store]: Elim1 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 96 treesize of output 71 [2022-12-13 11:14:17,135 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 32 [2022-12-13 11:14:17,144 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2022-12-13 11:14:17,296 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:14:17,297 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 26 [2022-12-13 11:14:17,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:14:17,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:14:17,359 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:17,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:17,472 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2020) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2019) |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_2018) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0)) is different from false [2022-12-13 11:14:17,487 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2020) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2019) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2018) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0) 4))) 0)) is different from false [2022-12-13 11:14:17,495 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2019 (Array Int Int)) (v_ArrVal_2018 (Array Int Int)) (v_ArrVal_2020 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_2020) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2019) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2018) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) 4))) 0)) is different from false [2022-12-13 11:14:17,810 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:17,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 58 [2022-12-13 11:14:19,007 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,007 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 77 [2022-12-13 11:14:19,017 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,018 INFO L350 Elim1Store]: Elim1 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 124 treesize of output 123 [2022-12-13 11:14:19,022 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 27 [2022-12-13 11:14:19,050 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:19,515 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-13 11:14:19,524 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,524 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:19,531 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 126 [2022-12-13 11:14:19,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 108 [2022-12-13 11:14:19,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-12-13 11:14:19,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:14:19,601 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,601 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:19,606 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-13 11:14:19,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-13 11:14:19,622 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:14:19,630 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,630 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 46 [2022-12-13 11:14:19,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:19,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2022-12-13 11:14:20,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:20,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 255 [2022-12-13 11:14:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-12-13 11:14:21,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679347577] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:21,537 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:21,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 22] total 49 [2022-12-13 11:14:21,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596357962] [2022-12-13 11:14:21,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:21,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 11:14:21,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:21,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 11:14:21,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=1848, Unknown=28, NotChecked=270, Total=2352 [2022-12-13 11:14:21,538 INFO L87 Difference]: Start difference. First operand 431 states and 509 transitions. Second operand has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:26,836 INFO L93 Difference]: Finished difference Result 570 states and 667 transitions. [2022-12-13 11:14:26,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 11:14:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-12-13 11:14:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:26,837 INFO L225 Difference]: With dead ends: 570 [2022-12-13 11:14:26,838 INFO L226 Difference]: Without dead ends: 570 [2022-12-13 11:14:26,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=398, Invalid=3004, Unknown=32, NotChecked=348, Total=3782 [2022-12-13 11:14:26,838 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 315 mSDsluCounter, 1487 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 47 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 472 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:26,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 1565 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2367 Invalid, 21 Unknown, 472 Unchecked, 3.3s Time] [2022-12-13 11:14:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-12-13 11:14:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 433. [2022-12-13 11:14:26,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 421 states have (on average 1.2137767220902613) internal successors, (511), 432 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 511 transitions. [2022-12-13 11:14:26,842 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 511 transitions. Word has length 51 [2022-12-13 11:14:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:26,842 INFO L495 AbstractCegarLoop]: Abstraction has 433 states and 511 transitions. [2022-12-13 11:14:26,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 511 transitions. [2022-12-13 11:14:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 11:14:26,842 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:26,842 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:26,847 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 11:14:27,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 11:14:27,044 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:14:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:27,045 INFO L85 PathProgramCache]: Analyzing trace with hash -583491704, now seen corresponding path program 1 times [2022-12-13 11:14:27,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:27,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30901077] [2022-12-13 11:14:27,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:27,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:28,154 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:28,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:28,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30901077] [2022-12-13 11:14:28,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30901077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:28,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799957508] [2022-12-13 11:14:28,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:28,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:28,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:14:28,155 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:28,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 11:14:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:28,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 76 conjunts are in the unsatisfiable core [2022-12-13 11:14:28,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:28,354 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:14:28,354 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:28,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:14:28,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:14:28,579 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:14:28,580 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 35 [2022-12-13 11:14:28,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:14:28,590 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 11:14:28,598 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:14:28,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 11:14:28,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:14:28,715 INFO L350 Elim1Store]: Elim1 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 21 [2022-12-13 11:14:28,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 11:14:28,754 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 11:14:28,755 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:28,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 11:14:28,793 INFO L350 Elim1Store]: Elim1 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 23 treesize of output 22 [2022-12-13 11:14:28,803 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 23 [2022-12-13 11:14:28,976 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 11:14:28,976 INFO L350 Elim1Store]: Elim1 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 97 treesize of output 72 [2022-12-13 11:14:28,984 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2022-12-13 11:14:28,990 INFO L350 Elim1Store]: Elim1 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 33 [2022-12-13 11:14:29,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:14:29,146 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:14:29,146 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 27 [2022-12-13 11:14:29,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 11:14:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:29,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:29,344 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2147 (Array Int Int))) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2149) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2148) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) 0))) is different from false [2022-12-13 11:14:29,361 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2149 (Array Int Int)) (v_ArrVal_2148 (Array Int Int)) (v_ArrVal_2147 (Array Int Int))) (not (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2149) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2148) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2147) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)))) 0))) is different from false [2022-12-13 11:14:29,657 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:29,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2022-12-13 11:14:29,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:29,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 78 [2022-12-13 11:14:30,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:30,011 INFO L350 Elim1Store]: Elim1 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 126 treesize of output 125 [2022-12-13 11:14:30,017 INFO L350 Elim1Store]: Elim1 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 78 treesize of output 58 [2022-12-13 11:14:30,061 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:30,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:30,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-13 11:14:30,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:30,620 INFO L350 Elim1Store]: Elim1 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 86 treesize of output 85 [2022-12-13 11:14:30,625 INFO L350 Elim1Store]: Elim1 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 70 treesize of output 62 [2022-12-13 11:14:30,634 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:30,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 56 [2022-12-13 11:14:30,695 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:30,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-13 11:14:30,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:14:30,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:30,703 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 46 [2022-12-13 11:14:30,712 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:30,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2022-12-13 11:14:30,755 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:30,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-12-13 11:14:30,759 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:14:30,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:30,767 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:30,770 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2022-12-13 11:14:31,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:31,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-12-13 11:14:33,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-13 11:14:33,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799957508] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:33,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:33,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 22] total 49 [2022-12-13 11:14:33,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699351374] [2022-12-13 11:14:33,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:33,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 11:14:33,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:33,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 11:14:33,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1933, Unknown=29, NotChecked=182, Total=2352 [2022-12-13 11:14:33,076 INFO L87 Difference]: Start difference. First operand 433 states and 511 transitions. Second operand has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:39,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:39,512 INFO L93 Difference]: Finished difference Result 567 states and 662 transitions. [2022-12-13 11:14:39,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-13 11:14:39,512 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-12-13 11:14:39,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:39,513 INFO L225 Difference]: With dead ends: 567 [2022-12-13 11:14:39,513 INFO L226 Difference]: Without dead ends: 567 [2022-12-13 11:14:39,513 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=386, Invalid=2895, Unknown=33, NotChecked=226, Total=3540 [2022-12-13 11:14:39,513 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 425 mSDsluCounter, 1318 mSDsCounter, 0 mSdLazyCounter, 2257 mSolverCounterSat, 51 mSolverCounterUnsat, 23 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1410 SdHoareTripleChecker+Invalid, 2746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2257 IncrementalHoareTripleChecker+Invalid, 23 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:39,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1410 Invalid, 2746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2257 Invalid, 23 Unknown, 415 Unchecked, 3.9s Time] [2022-12-13 11:14:39,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2022-12-13 11:14:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 431. [2022-12-13 11:14:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 419 states have (on average 1.2100238663484486) internal successors, (507), 430 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 507 transitions. [2022-12-13 11:14:39,518 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 507 transitions. Word has length 51 [2022-12-13 11:14:39,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:39,519 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 507 transitions. [2022-12-13 11:14:39,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.5918367346938775) internal successors, (127), 49 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:39,519 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 507 transitions. [2022-12-13 11:14:39,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 11:14:39,520 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:39,520 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:39,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-12-13 11:14:39,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:39,721 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:14:39,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:39,722 INFO L85 PathProgramCache]: Analyzing trace with hash -583799534, now seen corresponding path program 1 times [2022-12-13 11:14:39,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:39,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516335495] [2022-12-13 11:14:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:39,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:39,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:40,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:40,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516335495] [2022-12-13 11:14:40,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516335495] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:40,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041491126] [2022-12-13 11:14:40,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:40,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:40,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:14:40,562 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:40,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 11:14:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:40,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-13 11:14:40,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:40,758 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 11:14:40,758 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:40,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:14:40,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:14:41,066 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:14:41,066 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-12-13 11:14:41,069 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:41,088 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:14:41,089 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-12-13 11:14:41,199 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 11:14:41,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-12-13 11:14:41,202 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:41,219 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:14:41,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-12-13 11:14:41,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:14:41,307 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-12-13 11:14:41,307 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:41,400 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-13 11:14:41,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2022-12-13 11:14:41,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:14:41,411 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 23 [2022-12-13 11:14:41,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:14:41,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:14:41,673 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 11:14:41,674 INFO L350 Elim1Store]: Elim1 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 93 treesize of output 74 [2022-12-13 11:14:41,678 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 28 [2022-12-13 11:14:41,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:14:41,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-12-13 11:14:41,851 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:14:41,851 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 33 [2022-12-13 11:14:41,857 INFO L350 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 22 treesize of output 10 [2022-12-13 11:14:41,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:14:41,922 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:14:41,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:42,001 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (v_ArrVal_2275 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2277) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2276) |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_2275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2022-12-13 11:14:42,019 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (v_ArrVal_2275 (Array Int Int))) (= (let ((.cse0 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2277) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) 1)) is different from false [2022-12-13 11:14:42,028 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (v_ArrVal_2275 (Array Int Int))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base|) (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8))) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_2277) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_2276) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_2275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)) is different from false [2022-12-13 11:14:42,043 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2273 Int) (v_ArrVal_2277 (Array Int Int)) (v_ArrVal_2276 (Array Int Int)) (v_ArrVal_2275 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~p~0#1.offset| 8)) (.cse1 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (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|) .cse0 v_ArrVal_2273)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2277) (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_2276) |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| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~p~0#1.base|) .cse0 |c_ULTIMATE.start_main_~t~0#1.offset|)) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2275) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1))) 1)) is different from false [2022-12-13 11:14:42,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2022-12-13 11:14:42,148 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 70 [2022-12-13 11:14:42,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,162 INFO L350 Elim1Store]: Elim1 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 128 treesize of output 131 [2022-12-13 11:14:42,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 97 [2022-12-13 11:14:42,178 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:42,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 11:14:42,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-12-13 11:14:42,231 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:42,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-12-13 11:14:42,802 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,802 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:42,807 INFO L350 Elim1Store]: Elim1 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 142 treesize of output 126 [2022-12-13 11:14:42,815 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 136 treesize of output 108 [2022-12-13 11:14:42,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,921 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-12-13 11:14:42,924 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:14:42,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,930 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:42,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-12-13 11:14:42,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,961 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-12-13 11:14:42,964 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 11:14:42,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,973 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 46 [2022-12-13 11:14:42,983 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:42,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 33 [2022-12-13 11:14:43,470 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:43,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 62 treesize of output 216 [2022-12-13 11:14:44,560 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-12-13 11:14:44,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041491126] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:44,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:44,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 18] total 45 [2022-12-13 11:14:44,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267349757] [2022-12-13 11:14:44,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:44,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 11:14:44,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:44,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 11:14:44,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1461, Unknown=5, NotChecked=324, Total=1980 [2022-12-13 11:14:44,561 INFO L87 Difference]: Start difference. First operand 431 states and 507 transitions. Second operand has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:53,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:53,154 INFO L93 Difference]: Finished difference Result 595 states and 690 transitions. [2022-12-13 11:14:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 11:14:53,155 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 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 51 [2022-12-13 11:14:53,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:53,158 INFO L225 Difference]: With dead ends: 595 [2022-12-13 11:14:53,158 INFO L226 Difference]: Without dead ends: 595 [2022-12-13 11:14:53,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 76 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=440, Invalid=2874, Unknown=8, NotChecked=460, Total=3782 [2022-12-13 11:14:53,159 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 561 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 49 mSolverCounterUnsat, 20 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 2949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 20 IncrementalHoareTripleChecker+Unknown, 831 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:53,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1285 Invalid, 2949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2049 Invalid, 20 Unknown, 831 Unchecked, 3.2s Time] [2022-12-13 11:14:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-12-13 11:14:53,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 427. [2022-12-13 11:14:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 415 states have (on average 1.2096385542168675) internal successors, (502), 426 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 502 transitions. [2022-12-13 11:14:53,166 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 502 transitions. Word has length 51 [2022-12-13 11:14:53,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:53,166 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 502 transitions. [2022-12-13 11:14:53,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.8666666666666667) internal successors, (129), 45 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 502 transitions. [2022-12-13 11:14:53,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 11:14:53,167 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:53,167 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:53,172 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 11:14:53,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:53,368 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:14:53,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:53,369 INFO L85 PathProgramCache]: Analyzing trace with hash 450712335, now seen corresponding path program 1 times [2022-12-13 11:14:53,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:53,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016335011] [2022-12-13 11:14:53,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:53,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:14:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:14:53,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:14:53,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016335011] [2022-12-13 11:14:53,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016335011] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:14:53,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011622502] [2022-12-13 11:14:53,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:53,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:14:53,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:14:53,818 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:14:53,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 11:14:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:14:53,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-13 11:14:53,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:14:54,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 11:14:54,091 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:14:54,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 11:14:54,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 11:14:54,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 11:14:54,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:14:54,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-13 11:14:54,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:14:54,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:14:54,343 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 11:14:54,343 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:54,388 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:54,394 INFO L350 Elim1Store]: Elim1 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-12-13 11:14:54,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-12-13 11:14:54,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 11:14:54,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 11:14:54,578 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 11:14:54,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:14:54,645 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2399 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-12-13 11:14:54,655 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2399 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-12-13 11:14:54,660 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2399 (Array Int Int))) (< (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| 8)) v_ArrVal_2399) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-12-13 11:14:54,666 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2399 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2397) |c_ULTIMATE.start_main_~t~0#1.base| v_ArrVal_2399) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 3)) is different from false [2022-12-13 11:14:54,994 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 11:14:54,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-12-13 11:14:55,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:55,248 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2022-12-13 11:14:55,260 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:55,260 INFO L350 Elim1Store]: Elim1 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 122 treesize of output 121 [2022-12-13 11:14:55,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2022-12-13 11:14:55,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2022-12-13 11:14:55,484 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:14:55,484 INFO L350 Elim1Store]: Elim1 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 34 treesize of output 74 [2022-12-13 11:14:55,572 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 10 not checked. [2022-12-13 11:14:55,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011622502] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:14:55,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:14:55,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 46 [2022-12-13 11:14:55,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665227060] [2022-12-13 11:14:55,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:14:55,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 11:14:55,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:14:55,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 11:14:55,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=1494, Unknown=27, NotChecked=332, Total=2070 [2022-12-13 11:14:55,574 INFO L87 Difference]: Start difference. First operand 427 states and 502 transitions. Second operand has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:59,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:14:59,769 INFO L93 Difference]: Finished difference Result 911 states and 1070 transitions. [2022-12-13 11:14:59,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 11:14:59,769 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-12-13 11:14:59,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:14:59,771 INFO L225 Difference]: With dead ends: 911 [2022-12-13 11:14:59,771 INFO L226 Difference]: Without dead ends: 911 [2022-12-13 11:14:59,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=842, Invalid=4523, Unknown=53, NotChecked=588, Total=6006 [2022-12-13 11:14:59,772 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 674 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 103 mSolverCounterUnsat, 32 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1780 SdHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 32 IncrementalHoareTripleChecker+Unknown, 1037 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 11:14:59,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1780 Invalid, 3455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 2283 Invalid, 32 Unknown, 1037 Unchecked, 2.3s Time] [2022-12-13 11:14:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-12-13 11:14:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 510. [2022-12-13 11:14:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 498 states have (on average 1.1987951807228916) internal successors, (597), 509 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 597 transitions. [2022-12-13 11:14:59,780 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 597 transitions. Word has length 51 [2022-12-13 11:14:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:14:59,780 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 597 transitions. [2022-12-13 11:14:59,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.652173913043478) internal successors, (122), 46 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:14:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 597 transitions. [2022-12-13 11:14:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 11:14:59,781 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:14:59,781 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:14:59,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-12-13 11:14:59,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 11:14:59,982 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:14:59,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:14:59,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1013030303, now seen corresponding path program 1 times [2022-12-13 11:14:59,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:14:59,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882309599] [2022-12-13 11:14:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:14:59,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:15:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:15:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 11:15:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 11:15:00,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882309599] [2022-12-13 11:15:00,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882309599] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 11:15:00,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2061352819] [2022-12-13 11:15:00,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:15:00,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 11:15:00,599 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 11:15:00,600 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 11:15:00,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 11:15:00,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 11:15:00,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 11:15:00,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 11:15:01,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 11:15:01,229 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 11:15:01,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 43 [2022-12-13 11:15:01,584 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:15:01,585 INFO L350 Elim1Store]: Elim1 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 29 [2022-12-13 11:15:01,839 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2473 Int) (|v_ULTIMATE.start_main_~p~0#1.base_189| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_189| 1))) (and (= (select .cse0 |c_ULTIMATE.start_main_~p~0#1.base|) 0) (= |c_#valid| (store (store .cse0 |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2473) |v_ULTIMATE.start_main_~p~0#1.base_189| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_189|) 0)))) is different from true [2022-12-13 11:15:01,875 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~p~0#1.base| Int) (v_ArrVal_2473 Int) (|v_ULTIMATE.start_main_~p~0#1.base_189| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_189| 1))) (and (= |c_#valid| (store (store (store .cse0 |ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2473) |v_ULTIMATE.start_main_~p~0#1.base_189| 0) |ULTIMATE.start_main_~p~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~p~0#1.base_189|) 0) (= (select .cse0 |ULTIMATE.start_main_~p~0#1.base|) 0)))) is different from true [2022-12-13 11:15:01,883 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2022-12-13 11:15:01,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 11:15:02,139 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2476 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~p~0#1.base| v_ArrVal_2476) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-12-13 11:15:02,148 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2476 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_2476) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0))) is different from false [2022-12-13 11:15:02,152 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2476 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~a~0#1.base| 0) (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| 8)) v_ArrVal_2476) |c_ULTIMATE.start_main_~a~0#1.base|) 8) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2022-12-13 11:15:02,158 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:15:02,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-12-13 11:15:02,165 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 11:15:02,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 53 [2022-12-13 11:15:02,170 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 17 [2022-12-13 11:15:36,502 WARN L233 SmtUtils]: Spent 22.15s on a formula simplification. DAG size of input: 42 DAG size of output: 33 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:16:02,754 WARN L233 SmtUtils]: Spent 26.13s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:16:29,019 WARN L233 SmtUtils]: Spent 26.16s on a formula simplification that was a NOOP. DAG size: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:17:05,499 WARN L233 SmtUtils]: Spent 36.24s on a formula simplification. DAG size of input: 49 DAG size of output: 39 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:17:11,757 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:17:11,814 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 3 not checked. [2022-12-13 11:17:11,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2061352819] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 11:17:11,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 11:17:11,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 44 [2022-12-13 11:17:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928609497] [2022-12-13 11:17:11,814 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 11:17:11,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-12-13 11:17:11,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 11:17:11,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-12-13 11:17:11,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1418, Unknown=9, NotChecked=400, Total=1980 [2022-12-13 11:17:11,815 INFO L87 Difference]: Start difference. First operand 510 states and 597 transitions. Second operand has 45 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 45 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:17:37,670 WARN L233 SmtUtils]: Spent 22.13s on a formula simplification that was a NOOP. DAG size: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 11:17:38,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 11:17:38,100 INFO L93 Difference]: Finished difference Result 556 states and 642 transitions. [2022-12-13 11:17:38,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-13 11:17:38,100 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 45 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-12-13 11:17:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 11:17:38,101 INFO L225 Difference]: With dead ends: 556 [2022-12-13 11:17:38,101 INFO L226 Difference]: Without dead ends: 551 [2022-12-13 11:17:38,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 73 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 899 ImplicationChecksByTransitivity, 154.9s TimeCoverageRelationStatistics Valid=407, Invalid=3264, Unknown=9, NotChecked=610, Total=4290 [2022-12-13 11:17:38,101 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 335 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 11:17:38,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 933 Invalid, 1882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1215 Invalid, 0 Unknown, 602 Unchecked, 1.7s Time] [2022-12-13 11:17:38,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-12-13 11:17:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 506. [2022-12-13 11:17:38,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 494 states have (on average 1.1983805668016194) internal successors, (592), 505 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:17:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 592 transitions. [2022-12-13 11:17:38,105 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 592 transitions. Word has length 52 [2022-12-13 11:17:38,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 11:17:38,105 INFO L495 AbstractCegarLoop]: Abstraction has 506 states and 592 transitions. [2022-12-13 11:17:38,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.2954545454545454) internal successors, (145), 45 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 11:17:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 592 transitions. [2022-12-13 11:17:38,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 11:17:38,105 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 11:17:38,106 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 11:17:38,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 11:17:38,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-12-13 11:17:38,307 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-12-13 11:17:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 11:17:38,308 INFO L85 PathProgramCache]: Analyzing trace with hash 22625035, now seen corresponding path program 2 times [2022-12-13 11:17:38,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 11:17:38,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415756757] [2022-12-13 11:17:38,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 11:17:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 11:17:38,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:17:38,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 11:17:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 11:17:38,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 11:17:38,374 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 11:17:38,375 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 45 remaining) [2022-12-13 11:17:38,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2022-12-13 11:17:38,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2022-12-13 11:17:38,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE (13 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE (12 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE (11 of 45 remaining) [2022-12-13 11:17:38,378 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE (7 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_FREE (6 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (5 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (4 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (3 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (2 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_LEAK (1 of 45 remaining) [2022-12-13 11:17:38,379 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (0 of 45 remaining) [2022-12-13 11:17:38,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-12-13 11:17:38,381 INFO L445 BasicCegarLoop]: Path program histogram: [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-12-13 11:17:38,384 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 11:17:38,407 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 11:17:38 BoogieIcfgContainer [2022-12-13 11:17:38,407 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 11:17:38,407 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 11:17:38,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 11:17:38,408 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 11:17:38,408 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 11:12:06" (3/4) ... [2022-12-13 11:17:38,409 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 11:17:38,439 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 11:17:38,439 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 11:17:38,439 INFO L158 Benchmark]: Toolchain (without parser) took 333158.43ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 81.1MB in the beginning and 33.6MB in the end (delta: 47.5MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2022-12-13 11:17:38,439 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 91.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 11:17:38,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.01ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 64.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 11:17:38,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.51ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:17:38,439 INFO L158 Benchmark]: Boogie Preprocessor took 21.54ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 60.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 11:17:38,440 INFO L158 Benchmark]: RCFGBuilder took 428.64ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 60.1MB in the beginning and 112.5MB in the end (delta: -52.3MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-12-13 11:17:38,440 INFO L158 Benchmark]: TraceAbstraction took 332375.34ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 37.8MB in the end (delta: 73.8MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2022-12-13 11:17:38,440 INFO L158 Benchmark]: Witness Printer took 31.52ms. Allocated memory is still 142.6MB. Free memory was 37.8MB in the beginning and 33.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 11:17:38,440 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 91.8MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 267.01ms. Allocated memory is still 117.4MB. Free memory was 80.8MB in the beginning and 64.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.51ms. Allocated memory is still 117.4MB. Free memory was 64.0MB in the beginning and 61.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.54ms. Allocated memory is still 117.4MB. Free memory was 61.9MB in the beginning and 60.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 428.64ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 60.1MB in the beginning and 112.5MB in the end (delta: -52.3MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 332375.34ms. Allocated memory is still 142.6MB. Free memory was 111.6MB in the beginning and 37.8MB in the end (delta: 73.8MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. * Witness Printer took 31.52ms. Allocated memory is still 142.6MB. Free memory was 37.8MB in the beginning and 33.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L567] List p, a, t; [L568] a = (List) malloc(sizeof(struct node)) [L569] COND FALSE !(a == 0) VAL [a={6:0}] [L570] a->n = 0 VAL [a={6:0}] [L571] p = a [L572] int i = 0; VAL [a={6:0}, i=0, p={6:0}] [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=-1, a={6:0}, i=0, i < 20 && __VERIFIER_nondet_int()=1, p={6:0}] [L573] COND TRUE i < 20 && __VERIFIER_nondet_int() [L574] i++ [L575] p->flag = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={6:0}, i=1, p={6:0}] [L576] p->flag VAL [a={6:0}, i=1, p={6:0}, p->flag=0] [L576] COND FALSE !(p->flag) [L579] p->h = 2 VAL [a={6:0}, i=1, p={6:0}] [L581] t = (List) malloc(sizeof(struct node)) [L582] COND FALSE !(t == 0) VAL [a={6:0}, i=1, p={6:0}, t={5:0}] [L583] p->n = t VAL [a={6:0}, i=1, p={6:0}, t={5:0}] [L584] EXPR p->n VAL [a={6:0}, i=1, p={6:0}, p->n={5:0}, t={5:0}] [L584] p = p->n [L573] i < 20 && __VERIFIER_nondet_int() [L573] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={6:0}, i=1, i < 20 && __VERIFIER_nondet_int()=0, p={5:0}, t={5:0}] [L573] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L586] p->h = 3 VAL [a={6:0}, i=1, p={5:0}, t={5:0}] [L587] p = a VAL [a={6:0}, i=1, p={6:0}, t={5:0}] [L588] EXPR p->h VAL [a={6:0}, i=1, p={6:0}, p->h=2, t={5:0}] [L588] COND TRUE p->h != 3 [L589] p->flag VAL [a={6:0}, i=1, p={6:0}, p->flag=0, t={5:0}] [L589] COND FALSE !(p->flag) [L593] EXPR p->h VAL [a={6:0}, i=1, p={6:0}, p->h=2, t={5:0}] [L593] COND FALSE !(p->h != 2) [L596] EXPR p->n VAL [a={6:0}, i=1, p={6:0}, p->n={5:0}, t={5:0}] [L596] p = p->n [L597] i++ VAL [a={6:0}, i=2, p={5:0}, t={5:0}] [L588] EXPR p->h VAL [a={6:0}, i=2, p={5:0}, p->h=3, t={5:0}] [L588] COND FALSE !(p->h != 3) [L599] EXPR p->h VAL [a={6:0}, i=2, p={5:0}, p->h=3, t={5:0}] [L599] COND FALSE !(p->h != 3 || i > 20) [L601] p = a VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L602] COND FALSE !(p == 0) VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L605] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={5:0}, t={5:0}] [L605] COND FALSE !(p->n == 0) [L610] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={5:0}, t={5:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={6:0}, i=2, p={6:0}, p->n={5:0}, t={5:0}] [L611] t = p->n [L612] free(p) VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L612] free(p) VAL [a={6:0}, i=2, p={6:0}, t={5:0}] [L612] free(p) [L613] p = t VAL [a={6:0}, i=2, p={5:0}, t={5:0}] [L610] EXPR p->n VAL [a={6:0}, i=2, p={5:0}, p->n={49:59}, t={5:0}] [L610] COND TRUE p->n != 0 [L611] EXPR p->n VAL [a={6:0}, i=2, p={5:0}, p->n={49:59}, t={5:0}] [L611] t = p->n [L612] free(p) VAL [a={6:0}, i=2, p={5:0}, t={49:59}] [L612] free(p) VAL [a={6:0}, i=2, p={5:0}, t={49:59}] [L612] free(p) [L613] p = t VAL [a={6:0}, i=2, p={49:59}, t={49:59}] [L610] p->n - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 615]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 566]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 332.3s, OverallIterations: 38, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 124.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 226 mSolverCounterUnknown, 15684 SdHoareTripleChecker+Valid, 56.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15684 mSDsluCounter, 25897 SdHoareTripleChecker+Invalid, 53.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7957 IncrementalHoareTripleChecker+Unchecked, 23498 mSDsCounter, 2013 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34594 IncrementalHoareTripleChecker+Invalid, 44790 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2013 mSolverCounterUnsat, 2399 mSDtfsCounter, 34594 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2893 GetRequests, 1459 SyntacticMatches, 61 SemanticMatches, 1373 ConstructedPredicates, 50 IntricatePredicates, 5 DeprecatedPredicates, 20701 ImplicationChecksByTransitivity, 229.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred in iteration=36, InterpolantAutomatonStates: 733, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 3357 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 198.7s InterpolantComputationTime, 2290 NumberOfCodeBlocks, 2290 NumberOfCodeBlocksAsserted, 68 NumberOfCheckSat, 3139 ConstructedInterpolants, 583 QuantifiedInterpolants, 62492 SizeOfPredicates, 364 NumberOfNonLiveVariables, 6505 ConjunctsInSsa, 1050 ConjunctsInUnsatCore, 86 InterpolantComputations, 13 PerfectInterpolantSequences, 54/799 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 11:17:38,647 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-13 11:17:38,681 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_52af40ef-c3bc-4f7e-b027-9c7cd75f62ce/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)