./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- 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-38b53e6 [2022-11-26 00:47:10,845 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:47:10,848 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:47:10,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:47:10,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:47:10,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:47:10,905 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:47:10,908 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:47:10,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:47:10,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:47:10,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:47:10,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:47:10,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:47:10,924 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:47:10,925 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:47:10,928 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:47:10,930 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:47:10,931 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:47:10,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:47:10,938 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:47:10,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:47:10,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:47:10,953 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:47:10,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:47:10,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:47:10,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:47:10,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:47:10,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:47:10,967 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:47:10,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:47:10,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:47:10,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:47:10,971 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:47:10,973 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:47:10,974 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:47:10,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:47:10,974 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:47:10,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:47:10,975 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:47:10,977 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:47:10,977 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:47:10,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-26 00:47:11,016 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:47:11,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:47:11,018 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:47:11,018 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:47:11,019 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:47:11,019 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:47:11,019 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:47:11,019 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:47:11,020 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:47:11,020 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:47:11,021 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:47:11,021 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:47:11,021 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:47:11,022 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:47:11,022 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:47:11,022 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:47:11,022 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:47:11,022 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:47:11,024 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:47:11,024 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:47:11,024 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:47:11,024 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:47:11,024 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:47:11,025 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:47:11,025 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:47:11,025 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:47:11,026 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:47:11,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:47:11,026 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:47:11,026 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:47:11,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:47:11,027 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:47:11,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:47:11,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:47:11,028 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:47:11,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:47:11,028 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:47:11,028 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:47:11,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:47:11,029 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:47:11,029 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:47:11,029 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2022-11-26 00:47:11,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:47:11,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:47:11,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:47:11,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:47:11,339 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:47:11,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-11-26 00:47:14,329 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:47:14,682 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:47:14,684 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-11-26 00:47:14,700 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/data/975d6d197/0d5562f5665048dd80d9559ae7c3e5f2/FLAGac1c59369 [2022-11-26 00:47:14,929 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/data/975d6d197/0d5562f5665048dd80d9559ae7c3e5f2 [2022-11-26 00:47:14,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:47:14,936 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:47:14,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:47:14,941 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:47:14,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:47:14,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:47:14" (1/1) ... [2022-11-26 00:47:14,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e36a0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:14, skipping insertion in model container [2022-11-26 00:47:14,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:47:14" (1/1) ... [2022-11-26 00:47:14,954 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:47:14,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:47:15,270 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-11-26 00:47:15,282 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-11-26 00:47:15,290 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-11-26 00:47:15,293 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-11-26 00:47:15,296 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-11-26 00:47:15,298 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-11-26 00:47:15,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:47:15,321 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:47:15,369 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-11-26 00:47:15,372 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-11-26 00:47:15,376 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-11-26 00:47:15,377 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-11-26 00:47:15,378 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-11-26 00:47:15,379 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-11-26 00:47:15,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:47:15,405 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:47:15,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15 WrapperNode [2022-11-26 00:47:15,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:47:15,407 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:47:15,407 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:47:15,408 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:47:15,415 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,488 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 194 [2022-11-26 00:47:15,489 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:47:15,490 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:47:15,490 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:47:15,490 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:47:15,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,543 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,547 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:47:15,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:47:15,566 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:47:15,566 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:47:15,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (1/1) ... [2022-11-26 00:47:15,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:47:15,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:47:15,595 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:47:15,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:47:15,640 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:47:15,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:47:15,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:47:15,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:47:15,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:47:15,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:47:15,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:47:15,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:47:15,642 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:47:15,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:47:15,791 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:47:15,806 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:47:16,278 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:47:16,423 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:47:16,424 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-11-26 00:47:16,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:47:16 BoogieIcfgContainer [2022-11-26 00:47:16,430 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:47:16,432 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:47:16,432 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:47:16,435 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:47:16,435 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:47:14" (1/3) ... [2022-11-26 00:47:16,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d68c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:47:16, skipping insertion in model container [2022-11-26 00:47:16,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:47:15" (2/3) ... [2022-11-26 00:47:16,436 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d68c2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:47:16, skipping insertion in model container [2022-11-26 00:47:16,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:47:16" (3/3) ... [2022-11-26 00:47:16,438 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2022-11-26 00:47:16,454 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:47:16,454 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-26 00:47:16,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:47:16,502 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3f4cfda2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:47:16,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-26 00:47:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:16,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 00:47:16,512 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:16,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 00:47:16,513 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:47:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:16,518 INFO L85 PathProgramCache]: Analyzing trace with hash 245535628, now seen corresponding path program 1 times [2022-11-26 00:47:16,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:16,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339927472] [2022-11-26 00:47:16,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:16,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:16,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:16,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:16,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339927472] [2022-11-26 00:47:16,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339927472] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:16,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:16,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:47:16,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224746743] [2022-11-26 00:47:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:16,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:47:16,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:16,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:47:16,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:47:16,725 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 43 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:16,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:16,825 INFO L93 Difference]: Finished difference Result 85 states and 137 transitions. [2022-11-26 00:47:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:47:16,828 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-11-26 00:47:16,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:16,835 INFO L225 Difference]: With dead ends: 85 [2022-11-26 00:47:16,836 INFO L226 Difference]: Without dead ends: 42 [2022-11-26 00:47:16,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:47:16,842 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:16,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:47:16,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-26 00:47:16,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-11-26 00:47:16,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-11-26 00:47:16,892 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 5 [2022-11-26 00:47:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:16,893 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-11-26 00:47:16,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-11-26 00:47:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:47:16,894 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:16,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:47:16,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:47:16,895 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:47:16,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash -996419023, now seen corresponding path program 1 times [2022-11-26 00:47:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:16,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538481564] [2022-11-26 00:47:16,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:16,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:17,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:17,020 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:17,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538481564] [2022-11-26 00:47:17,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538481564] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:17,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:17,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:47:17,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331932960] [2022-11-26 00:47:17,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:17,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:47:17,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:17,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:47:17,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:47:17,029 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:17,138 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2022-11-26 00:47:17,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:47:17,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:47:17,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:17,140 INFO L225 Difference]: With dead ends: 84 [2022-11-26 00:47:17,140 INFO L226 Difference]: Without dead ends: 45 [2022-11-26 00:47:17,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:47:17,142 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:17,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 60 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:47:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-11-26 00:47:17,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-11-26 00:47:17,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.263157894736842) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:17,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-26 00:47:17,150 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 6 [2022-11-26 00:47:17,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:17,151 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-26 00:47:17,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:17,151 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-26 00:47:17,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:47:17,152 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:17,152 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-26 00:47:17,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:47:17,153 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:47:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:17,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1462768708, now seen corresponding path program 1 times [2022-11-26 00:47:17,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:17,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426807556] [2022-11-26 00:47:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:17,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:47:17,411 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:17,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426807556] [2022-11-26 00:47:17,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426807556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:47:17,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:47:17,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:47:17,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367827799] [2022-11-26 00:47:17,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:47:17,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:47:17,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:47:17,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:47:17,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:47:17,417 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:17,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:47:17,572 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-11-26 00:47:17,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:47:17,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 00:47:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:47:17,577 INFO L225 Difference]: With dead ends: 72 [2022-11-26 00:47:17,577 INFO L226 Difference]: Without dead ends: 70 [2022-11-26 00:47:17,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:47:17,579 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 102 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:47:17,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 51 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:47:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-26 00:47:17,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 42. [2022-11-26 00:47:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 41 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-11-26 00:47:17,588 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 8 [2022-11-26 00:47:17,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:47:17,589 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-11-26 00:47:17,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:47:17,589 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-11-26 00:47:17,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 00:47:17,590 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:47:17,590 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:47:17,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:47:17,591 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:47:17,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:47:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash 2117176794, now seen corresponding path program 1 times [2022-11-26 00:47:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:47:17,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812455681] [2022-11-26 00:47:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:17,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:47:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:19,561 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:47:19,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812455681] [2022-11-26 00:47:19,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812455681] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:47:19,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1515569210] [2022-11-26 00:47:19,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:47:19,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:47:19,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:47:19,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:47:19,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:47:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:47:19,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-26 00:47:19,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:47:19,758 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-11-26 00:47:19,845 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 0 case distinctions, treesize of input 217 treesize of output 153 [2022-11-26 00:47:19,853 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 0 case distinctions, treesize of input 193 treesize of output 177 [2022-11-26 00:47:19,900 INFO L321 Elim1Store]: treesize reduction 67, result has 20.2 percent of original size [2022-11-26 00:47:19,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 306 treesize of output 287 [2022-11-26 00:47:19,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:47:19,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:47:19,945 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-26 00:47:19,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 252 treesize of output 273 [2022-11-26 00:47:19,959 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 334 treesize of output 312 [2022-11-26 00:47:20,028 INFO L321 Elim1Store]: treesize reduction 112, result has 27.7 percent of original size [2022-11-26 00:47:20,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 200 treesize of output 351 [2022-11-26 00:47:20,070 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-26 00:47:20,070 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 15 treesize of output 15 [2022-11-26 00:47:20,421 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-26 00:47:20,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 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 91 treesize of output 57 [2022-11-26 00:47:20,852 INFO L321 Elim1Store]: treesize reduction 153, result has 28.2 percent of original size [2022-11-26 00:47:20,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 5 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 577 treesize of output 746 [2022-11-26 00:47:22,066 INFO L321 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2022-11-26 00:47:22,067 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 144 treesize of output 143 [2022-11-26 00:47:22,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:47:22,118 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 18 treesize of output 1 [2022-11-26 00:47:22,169 INFO L321 Elim1Store]: treesize reduction 41, result has 44.6 percent of original size [2022-11-26 00:47:22,169 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 45 [2022-11-26 00:47:22,212 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 0 case distinctions, treesize of input 109 treesize of output 102 [2022-11-26 00:47:22,303 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 90 treesize of output 81 [2022-11-26 00:47:22,330 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-11-26 00:47:22,330 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 2 case distinctions, treesize of input 46 treesize of output 9 [2022-11-26 00:47:22,346 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 3 [2022-11-26 00:47:23,437 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 319 treesize of output 195 [2022-11-26 00:47:23,447 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:47:23,447 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 200 treesize of output 184 [2022-11-26 00:47:23,454 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 180 treesize of output 166 [2022-11-26 00:47:23,559 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:47:23,560 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 67 treesize of output 55 [2022-11-26 00:47:23,572 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-11-26 00:47:23,576 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-11-26 00:47:23,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:47:23,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:47:23,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:47:23,729 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 130 treesize of output 99 [2022-11-26 00:47:23,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:47:23,761 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 844 treesize of output 695 [2022-11-26 00:47:23,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:47:23,779 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 678 treesize of output 526 [2022-11-26 00:47:23,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:47:23,814 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 2986 treesize of output 2769 [2022-11-26 00:47:23,873 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 2438 treesize of output 2042 [2022-11-26 00:47:24,231 INFO L321 Elim1Store]: treesize reduction 294, result has 39.6 percent of original size [2022-11-26 00:47:24,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 3422 treesize of output 2974 [2022-11-26 00:47:24,563 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 1848 treesize of output 1764 [2022-11-26 00:47:24,630 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 1591 treesize of output 1547 [2022-11-26 00:47:24,704 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 1565 treesize of output 1521 [2022-11-26 00:47:24,764 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 1706 treesize of output 1622 [2022-11-26 00:47:24,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 1574 treesize of output 1502 [2022-11-26 00:48:45,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:45,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1515569210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:48:45,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [321454356] [2022-11-26 00:48:45,909 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 00:48:45,910 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:48:45,917 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:48:45,926 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:48:45,927 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:48:46,007 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-11-26 00:48:46,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 30 [2022-11-26 00:48:46,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,027 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-26 00:48:46,067 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-26 00:48:46,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 41 [2022-11-26 00:48:46,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-11-26 00:48:46,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 46 [2022-11-26 00:48:46,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:46,272 INFO L321 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2022-11-26 00:48:46,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 336 treesize of output 237 [2022-11-26 00:48:46,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,339 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:48:46,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 10 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 202 treesize of output 103 [2022-11-26 00:48:46,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 11 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 206 treesize of output 201 [2022-11-26 00:48:46,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,480 INFO L321 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2022-11-26 00:48:46,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 61 [2022-11-26 00:48:46,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-26 00:48:46,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:46,626 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 87 [2022-11-26 00:48:46,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,636 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 30 treesize of output 20 [2022-11-26 00:48:46,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-11-26 00:48:46,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,836 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:46,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,905 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-11-26 00:48:46,905 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 1 case distinctions, treesize of input 320 treesize of output 226 [2022-11-26 00:48:46,914 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 9 [2022-11-26 00:48:46,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:46,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:46,993 INFO L321 Elim1Store]: treesize reduction 140, result has 11.9 percent of original size [2022-11-26 00:48:46,993 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 2 case distinctions, treesize of input 160 treesize of output 92 [2022-11-26 00:48:47,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:47,060 INFO L321 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2022-11-26 00:48:47,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 160 [2022-11-26 00:48:47,188 INFO L321 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2022-11-26 00:48:47,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 67 [2022-11-26 00:48:47,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-11-26 00:48:47,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:47,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-11-26 00:48:47,261 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-11-26 00:48:47,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:47,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:47,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,588 INFO L321 Elim1Store]: treesize reduction 112, result has 11.8 percent of original size [2022-11-26 00:48:47,589 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 2 case distinctions, treesize of input 320 treesize of output 222 [2022-11-26 00:48:47,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:47,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,642 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-26 00:48:47,643 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 1 case distinctions, treesize of input 218 treesize of output 96 [2022-11-26 00:48:47,651 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-11-26 00:48:47,655 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 9 [2022-11-26 00:48:47,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:47,718 INFO L321 Elim1Store]: treesize reduction 48, result has 49.5 percent of original size [2022-11-26 00:48:47,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 140 treesize of output 160 [2022-11-26 00:48:47,840 INFO L321 Elim1Store]: treesize reduction 21, result has 36.4 percent of original size [2022-11-26 00:48:47,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 67 [2022-11-26 00:48:47,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 18 [2022-11-26 00:48:47,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:48:47,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:47,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2022-11-26 00:48:47,903 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:48:48,931 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '635#(and (not (= |ULTIMATE.start_main_~head~0#1.base| 0)) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 8)) 0)) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) 1)) (= |ULTIMATE.start_main_~marked~0#1| 0) (or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-26 00:48:48,932 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:48:48,932 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:48:48,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-11-26 00:48:48,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82101997] [2022-11-26 00:48:48,932 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:48:48,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-26 00:48:48,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:48:48,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-26 00:48:48,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=699, Unknown=7, NotChecked=0, Total=812 [2022-11-26 00:48:48,934 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:54,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:48:54,948 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-11-26 00:48:54,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-26 00:48:54,949 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-26 00:48:54,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:48:54,951 INFO L225 Difference]: With dead ends: 152 [2022-11-26 00:48:54,951 INFO L226 Difference]: Without dead ends: 150 [2022-11-26 00:48:54,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=199, Invalid=1264, Unknown=19, NotChecked=0, Total=1482 [2022-11-26 00:48:54,955 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 253 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 16 mSolverCounterUnsat, 62 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 62 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:48:54,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 463 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 311 Invalid, 62 Unknown, 0 Unchecked, 3.6s Time] [2022-11-26 00:48:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-26 00:48:54,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 54. [2022-11-26 00:48:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:54,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-11-26 00:48:54,984 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 16 [2022-11-26 00:48:54,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:48:54,985 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-11-26 00:48:54,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.5294117647058822) internal successors, (43), 16 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:48:54,985 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-11-26 00:48:54,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:48:54,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:48:54,986 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:48:55,001 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 00:48:55,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:48:55,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:48:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:48:55,192 INFO L85 PathProgramCache]: Analyzing trace with hash -952069976, now seen corresponding path program 1 times [2022-11-26 00:48:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:48:55,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980142933] [2022-11-26 00:48:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:55,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:48:55,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:56,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:56,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:48:56,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980142933] [2022-11-26 00:48:56,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980142933] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:48:56,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926807046] [2022-11-26 00:48:56,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:48:56,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:48:56,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:48:56,143 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:48:56,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:48:56,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:48:56,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 63 conjunts are in the unsatisfiable core [2022-11-26 00:48:56,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:48:56,288 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-11-26 00:48:56,383 INFO L321 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-11-26 00:48:56,384 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 2 case distinctions, treesize of input 1082 treesize of output 800 [2022-11-26 00:48:56,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 0 case distinctions, treesize of input 794 treesize of output 610 [2022-11-26 00:48:56,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,436 INFO L321 Elim1Store]: treesize reduction 191, result has 2.6 percent of original size [2022-11-26 00:48:56,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 656 treesize of output 592 [2022-11-26 00:48:56,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,487 INFO L321 Elim1Store]: treesize reduction 214, result has 2.3 percent of original size [2022-11-26 00:48:56,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 528 treesize of output 424 [2022-11-26 00:48:56,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 231 [2022-11-26 00:48:56,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,534 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 25 treesize of output 33 [2022-11-26 00:48:56,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,566 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 25 treesize of output 33 [2022-11-26 00:48:56,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,596 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 39 treesize of output 47 [2022-11-26 00:48:56,614 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,624 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 39 treesize of output 47 [2022-11-26 00:48:56,655 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:48:56,655 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-11-26 00:48:56,679 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 8 treesize of output 7 [2022-11-26 00:48:56,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 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 110 treesize of output 76 [2022-11-26 00:48:56,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,705 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 60 treesize of output 38 [2022-11-26 00:48:56,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:48:56,726 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 35 treesize of output 21 [2022-11-26 00:48:56,736 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 56 treesize of output 33 [2022-11-26 00:48:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:48:56,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:48:57,261 INFO L321 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2022-11-26 00:48:57,261 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 4 case distinctions, treesize of input 2016 treesize of output 1460 [2022-11-26 00:48:57,294 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:48:57,294 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 1420 treesize of output 1109 [2022-11-26 00:48:59,627 INFO L321 Elim1Store]: treesize reduction 387, result has 34.6 percent of original size [2022-11-26 00:48:59,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 1935 treesize of output 2133 [2022-11-26 00:49:16,294 WARN L233 SmtUtils]: Spent 16.63s on a formula simplification. DAG size of input: 428 DAG size of output: 128 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-26 00:49:16,294 INFO L321 Elim1Store]: treesize reduction 1718, result has 17.0 percent of original size [2022-11-26 00:49:16,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 12 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 16 new quantified variables, introduced 63 case distinctions, treesize of input 4007 treesize of output 4973 [2022-11-26 00:49:16,801 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 3305 treesize of output 2865 [2022-11-26 00:49:17,629 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:49:17,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 1170 treesize of output 1257 [2022-11-26 00:49:17,993 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 201 treesize of output 161 [2022-11-26 00:49:18,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:49:18,530 INFO L217 Elim1Store]: Index analysis took 273 ms [2022-11-26 00:49:18,965 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:49:18,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 109 [2022-11-26 00:49:19,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:49:19,497 INFO L217 Elim1Store]: Index analysis took 246 ms [2022-11-26 00:49:19,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:49:19,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 121 [2022-11-26 00:49:20,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:49:20,592 INFO L217 Elim1Store]: Index analysis took 287 ms [2022-11-26 00:49:20,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:49:20,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 117 [2022-11-26 00:49:36,077 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:49:36,078 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 1 case distinctions, treesize of input 9 treesize of output 8 [2022-11-26 00:49:36,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 1 [2022-11-26 00:49:49,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:49:50,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:49:50,710 INFO L217 Elim1Store]: Index analysis took 1486 ms [2022-11-26 00:49:51,057 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-26 00:49:51,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 7 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 424 treesize of output 683 [2022-11-26 00:49:56,001 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:49:56,148 INFO L217 Elim1Store]: Index analysis took 147 ms [2022-11-26 00:49:56,378 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:49:56,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 105 [2022-11-26 00:49:57,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:49:57,537 INFO L217 Elim1Store]: Index analysis took 303 ms [2022-11-26 00:49:58,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:49:58,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 105 [2022-11-26 00:50:01,096 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:01,308 INFO L217 Elim1Store]: Index analysis took 212 ms [2022-11-26 00:50:01,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:01,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 105 [2022-11-26 00:50:34,939 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:35,054 INFO L217 Elim1Store]: Index analysis took 116 ms [2022-11-26 00:50:35,502 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:35,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 203 treesize of output 185 [2022-11-26 00:50:36,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:50:36,647 INFO L217 Elim1Store]: Index analysis took 104 ms [2022-11-26 00:50:36,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:50:36,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:50:36,770 INFO L321 Elim1Store]: treesize reduction 9, result has 72.7 percent of original size [2022-11-26 00:50:36,771 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 203 treesize of output 137 [2022-11-26 00:50:37,151 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no need to replace index [2022-11-26 00:50:37,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [967813583] [2022-11-26 00:50:37,153 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-26 00:50:37,153 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:50:37,153 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:50:37,154 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:50:37,154 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:50:37,206 FATAL L? ?]: Ignoring exception! java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@67ab86b7 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.assertLhs(IncrementalPlicationChecker.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker.checkPlication(IncrementalPlicationChecker.java:134) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.ArrayIndexEqualityManager.(ArrayIndexEqualityManager.java:92) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:401) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:627) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:606) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyEliminationToAtom(QuantifierPusher.java:298) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:171) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:295) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:281) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.newQuantifier(SymbolicTools.java:285) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools$EliminatingTermDomainOperationProvider.projectExistentially(SymbolicTools.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.TermDomainOperationProvider.projectExistentially(TermDomainOperationProvider.java:1) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateTransformer.strongestPostcondition(PredicateTransformer.java:131) at de.uni_freiburg.informatik.ultimate.lib.sifa.SymbolicTools.post(SymbolicTools.java:119) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretInternal(DagInterpreter.java:227) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTransAndStoreLoiPred(DagInterpreter.java:209) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretTrans(DagInterpreter.java:187) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:165) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:50:37,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:50:37,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-11-26 00:50:37,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207702389] [2022-11-26 00:50:37,210 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-11-26 00:50:37,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:50:37,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:50:37,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:50:37,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:50:37,211 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:50:37,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:50:37,214 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:50:37,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:50:37,228 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:50:37,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:50:37,423 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@67ab86b7 at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:360) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:206) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:131) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.checkInternal(ChainingHoareTripleChecker.java:460) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.checkInternal(ChainingHoareTripleChecker.java:104) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:357) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.chooseFalseSuccessor2(BasicAbstractInterpolantAutomaton.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:73) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:353) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:325) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-26 00:50:37,426 INFO L158 Benchmark]: Toolchain (without parser) took 202489.21ms. Allocated memory was 155.2MB in the beginning and 828.4MB in the end (delta: 673.2MB). Free memory was 124.6MB in the beginning and 437.3MB in the end (delta: -312.7MB). Peak memory consumption was 361.0MB. Max. memory is 16.1GB. [2022-11-26 00:50:37,426 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 119.5MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:50:37,426 INFO L158 Benchmark]: CACSL2BoogieTranslator took 466.10ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 105.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-26 00:50:37,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.29ms. Allocated memory is still 155.2MB. Free memory was 105.1MB in the beginning and 103.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:50:37,432 INFO L158 Benchmark]: Boogie Preprocessor took 69.85ms. Allocated memory is still 155.2MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:50:37,432 INFO L158 Benchmark]: RCFGBuilder took 869.38ms. Allocated memory is still 155.2MB. Free memory was 100.9MB in the beginning and 107.8MB in the end (delta: -6.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-26 00:50:37,432 INFO L158 Benchmark]: TraceAbstraction took 200993.46ms. Allocated memory was 155.2MB in the beginning and 828.4MB in the end (delta: 673.2MB). Free memory was 106.8MB in the beginning and 437.3MB in the end (delta: -330.5MB). Peak memory consumption was 345.1MB. Max. memory is 16.1GB. [2022-11-26 00:50:37,433 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.22ms. Allocated memory is still 119.5MB. Free memory is still 94.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 466.10ms. Allocated memory is still 155.2MB. Free memory was 124.0MB in the beginning and 105.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.29ms. Allocated memory is still 155.2MB. Free memory was 105.1MB in the beginning and 103.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.85ms. Allocated memory is still 155.2MB. Free memory was 103.0MB in the beginning and 100.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 869.38ms. Allocated memory is still 155.2MB. Free memory was 100.9MB in the beginning and 107.8MB in the end (delta: -6.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 200993.46ms. Allocated memory was 155.2MB in the beginning and 828.4MB in the end (delta: 673.2MB). Free memory was 106.8MB in the beginning and 437.3MB in the end (delta: -330.5MB). Peak memory consumption was 345.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@67ab86b7 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.smtlibutils.IncrementalPlicationChecker@67ab86b7: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.lock(ManagedScript.java:82) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-26 00:50:37,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- 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-38b53e6 [2022-11-26 00:50:39,907 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:50:39,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:50:39,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:50:39,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:50:39,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:50:39,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:50:39,959 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:50:39,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:50:39,966 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:50:39,967 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:50:39,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:50:39,968 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:50:39,969 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:50:39,970 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:50:39,971 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:50:39,972 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:50:39,973 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:50:39,974 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:50:39,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:50:39,988 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:50:39,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:50:39,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:50:39,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:50:39,999 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:50:40,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:50:40,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:50:40,001 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:50:40,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:50:40,002 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:50:40,002 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:50:40,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:50:40,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:50:40,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:50:40,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:50:40,024 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:50:40,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:50:40,025 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:50:40,025 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:50:40,026 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:50:40,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:50:40,027 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2022-11-26 00:50:40,071 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:50:40,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:50:40,073 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:50:40,073 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:50:40,074 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:50:40,075 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:50:40,075 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:50:40,075 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:50:40,075 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:50:40,075 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:50:40,076 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:50:40,077 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:50:40,077 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:50:40,078 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:50:40,078 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:50:40,078 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:50:40,078 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:50:40,078 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:50:40,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:50:40,079 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:50:40,079 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-26 00:50:40,079 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-26 00:50:40,079 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:50:40,079 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:50:40,080 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:50:40,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:50:40,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:50:40,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-26 00:50:40,080 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:50:40,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:50:40,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:50:40,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:50:40,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:50:40,082 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2022-11-26 00:50:40,082 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-26 00:50:40,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:50:40,082 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:50:40,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-26 00:50:40,083 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2022-11-26 00:50:40,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:50:40,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:50:40,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:50:40,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:50:40,510 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:50:40,512 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-11-26 00:50:43,610 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:50:44,000 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:50:44,001 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-11-26 00:50:44,021 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/data/8355c35c8/e050fbc44ba6434eaf3040439612d68c/FLAG4d80658e0 [2022-11-26 00:50:44,041 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/data/8355c35c8/e050fbc44ba6434eaf3040439612d68c [2022-11-26 00:50:44,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:50:44,046 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:50:44,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:50:44,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:50:44,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:50:44,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ae705ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44, skipping insertion in model container [2022-11-26 00:50:44,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,061 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:50:44,095 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:50:44,406 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-11-26 00:50:44,412 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-11-26 00:50:44,417 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-11-26 00:50:44,418 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-11-26 00:50:44,419 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-11-26 00:50:44,420 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-11-26 00:50:44,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:50:44,437 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:50:44,544 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-11-26 00:50:44,547 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-11-26 00:50:44,556 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-11-26 00:50:44,561 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-11-26 00:50:44,563 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-11-26 00:50:44,564 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_3df6daf3-e1ba-4604-8619-ba19bcce14c9/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-11-26 00:50:44,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:50:44,612 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:50:44,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44 WrapperNode [2022-11-26 00:50:44,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:50:44,615 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:50:44,616 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:50:44,616 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:50:44,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,671 INFO L138 Inliner]: procedures = 122, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 187 [2022-11-26 00:50:44,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:50:44,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:50:44,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:50:44,673 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:50:44,682 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,711 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,712 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:50:44,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:50:44,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:50:44,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:50:44,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (1/1) ... [2022-11-26 00:50:44,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:50:44,754 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:50:44,769 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:50:44,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:50:44,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-11-26 00:50:44,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:50:44,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:50:44,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:50:44,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:50:44,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:50:44,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-26 00:50:44,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-26 00:50:44,823 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:50:44,823 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:50:44,985 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:50:44,987 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:50:45,861 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:50:45,867 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:50:45,867 INFO L300 CfgBuilder]: Removed 18 assume(true) statements. [2022-11-26 00:50:45,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:50:45 BoogieIcfgContainer [2022-11-26 00:50:45,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:50:45,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:50:45,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:50:45,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:50:45,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:50:44" (1/3) ... [2022-11-26 00:50:45,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b34435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:50:45, skipping insertion in model container [2022-11-26 00:50:45,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:50:44" (2/3) ... [2022-11-26 00:50:45,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b34435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:50:45, skipping insertion in model container [2022-11-26 00:50:45,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:50:45" (3/3) ... [2022-11-26 00:50:45,887 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2022-11-26 00:50:45,908 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:50:45,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-26 00:50:46,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:50:46,012 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@5c8c0cf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:50:46,013 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-26 00:50:46,018 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 47 states have (on average 1.872340425531915) internal successors, (88), 53 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:46,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:50:46,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:50:46,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:50:46,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:50:46,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:50:46,037 INFO L85 PathProgramCache]: Analyzing trace with hash 890122502, now seen corresponding path program 1 times [2022-11-26 00:50:46,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:50:46,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [928521505] [2022-11-26 00:50:46,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:46,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:50:46,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:50:46,063 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:50:46,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-26 00:50:46,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:46,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-26 00:50:46,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:50:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:46,238 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:50:46,239 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:50:46,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [928521505] [2022-11-26 00:50:46,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [928521505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:50:46,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:50:46,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:50:46,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495330982] [2022-11-26 00:50:46,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:50:46,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-26 00:50:46,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:50:46,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-26 00:50:46,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:50:46,307 INFO L87 Difference]: Start difference. First operand has 54 states, 47 states have (on average 1.872340425531915) internal successors, (88), 53 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:46,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:50:46,344 INFO L93 Difference]: Finished difference Result 103 states and 167 transitions. [2022-11-26 00:50:46,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-26 00:50:46,347 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:50:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:50:46,356 INFO L225 Difference]: With dead ends: 103 [2022-11-26 00:50:46,356 INFO L226 Difference]: Without dead ends: 48 [2022-11-26 00:50:46,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-26 00:50:46,367 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:50:46,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:50:46,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-26 00:50:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-26 00:50:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 47 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-11-26 00:50:46,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-11-26 00:50:46,414 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 6 [2022-11-26 00:50:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:50:46,415 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-11-26 00:50:46,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-11-26 00:50:46,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-26 00:50:46,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:50:46,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-26 00:50:46,435 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:50:46,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:50:46,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:50:46,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:50:46,631 INFO L85 PathProgramCache]: Analyzing trace with hash 889645846, now seen corresponding path program 1 times [2022-11-26 00:50:46,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:50:46,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863592668] [2022-11-26 00:50:46,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:46,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:50:46,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:50:46,661 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:50:46,675 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-26 00:50:46,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:46,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-26 00:50:46,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:50:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:46,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:50:46,786 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:50:46,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863592668] [2022-11-26 00:50:46,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863592668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:50:46,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:50:46,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:50:46,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137136440] [2022-11-26 00:50:46,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:50:46,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:50:46,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:50:46,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:50:46,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:50:46,804 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:50:46,952 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-11-26 00:50:46,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:50:46,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-26 00:50:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:50:46,954 INFO L225 Difference]: With dead ends: 98 [2022-11-26 00:50:46,954 INFO L226 Difference]: Without dead ends: 52 [2022-11-26 00:50:46,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:50:46,956 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:50:46,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 76 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:50:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-26 00:50:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-11-26 00:50:46,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 50 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-11-26 00:50:46,964 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 6 [2022-11-26 00:50:46,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:50:46,965 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-11-26 00:50:46,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-11-26 00:50:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-26 00:50:46,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:50:46,966 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:50:46,988 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:50:47,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:50:47,179 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:50:47,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:50:47,180 INFO L85 PathProgramCache]: Analyzing trace with hash 586319425, now seen corresponding path program 1 times [2022-11-26 00:50:47,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:50:47,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077781763] [2022-11-26 00:50:47,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:47,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:50:47,181 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:50:47,182 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:50:47,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-26 00:50:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:47,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:50:47,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:50:47,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:50:47,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:50:47,375 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:50:47,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077781763] [2022-11-26 00:50:47,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077781763] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:50:47,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:50:47,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:50:47,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691245229] [2022-11-26 00:50:47,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:50:47,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:50:47,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:50:47,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:50:47,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:50:47,378 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:50:48,082 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2022-11-26 00:50:48,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:50:48,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-26 00:50:48,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:50:48,086 INFO L225 Difference]: With dead ends: 83 [2022-11-26 00:50:48,087 INFO L226 Difference]: Without dead ends: 81 [2022-11-26 00:50:48,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:50:48,088 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 128 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-26 00:50:48,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 60 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-26 00:50:48,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-26 00:50:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 49. [2022-11-26 00:50:48,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.3409090909090908) internal successors, (59), 48 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:48,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2022-11-26 00:50:48,106 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 9 [2022-11-26 00:50:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:50:48,106 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2022-11-26 00:50:48,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:50:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2022-11-26 00:50:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-26 00:50:48,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:50:48,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:50:48,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:50:48,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:50:48,323 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:50:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:50:48,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1875453307, now seen corresponding path program 1 times [2022-11-26 00:50:48,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:50:48,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28006490] [2022-11-26 00:50:48,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:48,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:50:48,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:50:48,330 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:50:48,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-26 00:50:48,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:48,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 59 conjunts are in the unsatisfiable core [2022-11-26 00:50:48,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:50:48,587 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 7 [2022-11-26 00:50:48,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:50:48,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:50:48,714 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 0 case distinctions, treesize of input 34 treesize of output 24 [2022-11-26 00:50:48,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:50:48,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:50:48,730 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 0 case distinctions, treesize of input 34 treesize of output 24 [2022-11-26 00:50:48,771 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-11-26 00:50:48,772 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 42 [2022-11-26 00:50:48,828 INFO L321 Elim1Store]: treesize reduction 14, result has 65.0 percent of original size [2022-11-26 00:50:48,828 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 45 [2022-11-26 00:50:48,852 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-11-26 00:50:48,879 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 11 treesize of output 7 [2022-11-26 00:50:48,913 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-26 00:50:48,913 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 17 treesize of output 17 [2022-11-26 00:50:48,926 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-11-26 00:50:49,022 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:50:49,022 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 48 treesize of output 45 [2022-11-26 00:50:49,030 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 19 treesize of output 11 [2022-11-26 00:50:49,044 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-11-26 00:50:49,278 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-11-26 00:50:49,282 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 27 treesize of output 15 [2022-11-26 00:50:49,321 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-11-26 00:50:49,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:49,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:50:49,541 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 69 treesize of output 49 [2022-11-26 00:50:49,569 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_213 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_214 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_214) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-11-26 00:50:49,766 INFO L321 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2022-11-26 00:50:49,766 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 2 case distinctions, treesize of input 233 treesize of output 212 [2022-11-26 00:50:49,840 INFO L321 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-11-26 00:50:49,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 177 [2022-11-26 00:50:49,924 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:49,924 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 272 treesize of output 285 [2022-11-26 00:50:49,968 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 221 treesize of output 213 [2022-11-26 00:50:50,155 INFO L321 Elim1Store]: treesize reduction 56, result has 48.1 percent of original size [2022-11-26 00:50:50,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 277 treesize of output 291 [2022-11-26 00:50:50,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:50,195 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 355 treesize of output 311 [2022-11-26 00:50:50,223 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 209 treesize of output 205 [2022-11-26 00:50:50,366 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 6 [2022-11-26 00:50:50,901 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:50,901 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 21 treesize of output 25 [2022-11-26 00:50:50,940 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 6 treesize of output 4 [2022-11-26 00:50:51,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:51,223 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 150 treesize of output 164 [2022-11-26 00:50:51,703 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 34 [2022-11-26 00:50:51,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:51,869 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2022-11-26 00:50:51,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28006490] [2022-11-26 00:50:51,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28006490] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:50:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [717211272] [2022-11-26 00:50:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:51,870 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-11-26 00:50:51,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/cvc4 [2022-11-26 00:50:51,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-11-26 00:50:51,891 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-11-26 00:50:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:52,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-26 00:50:52,146 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:50:52,161 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 7 [2022-11-26 00:50:52,213 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-26 00:50:52,223 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-26 00:50:52,260 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-11-26 00:50:52,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 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 70 [2022-11-26 00:50:52,276 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-26 00:50:52,276 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 17 treesize of output 17 [2022-11-26 00:50:52,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:50:52,293 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 28 treesize of output 25 [2022-11-26 00:50:52,372 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:50:52,373 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 48 treesize of output 45 [2022-11-26 00:50:52,381 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-11-26 00:50:52,392 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 19 treesize of output 11 [2022-11-26 00:50:52,555 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-11-26 00:50:52,559 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 27 treesize of output 15 [2022-11-26 00:50:52,572 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-11-26 00:50:52,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:52,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:50:52,639 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 69 treesize of output 49 [2022-11-26 00:50:52,653 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_306 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~x~0#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_304 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_304) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) is different from false [2022-11-26 00:50:52,703 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:52,704 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 103 treesize of output 96 [2022-11-26 00:50:52,717 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:52,717 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 87 treesize of output 64 [2022-11-26 00:50:52,750 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:52,750 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 217 treesize of output 160 [2022-11-26 00:50:52,788 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:52,788 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 332 treesize of output 299 [2022-11-26 00:50:52,825 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 283 treesize of output 271 [2022-11-26 00:50:52,839 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 271 treesize of output 259 [2022-11-26 00:50:52,853 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 259 treesize of output 255 [2022-11-26 00:50:52,868 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 255 treesize of output 249 [2022-11-26 00:50:52,882 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 249 treesize of output 217 [2022-11-26 00:50:52,896 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 217 treesize of output 215 [2022-11-26 00:50:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:53,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [717211272] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:50:53,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023251813] [2022-11-26 00:50:53,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:50:53,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:50:53,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:50:53,134 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:50:53,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:50:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:50:53,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-26 00:50:53,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:50:53,286 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 7 [2022-11-26 00:50:53,371 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-11-26 00:50:53,382 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 0 case distinctions, treesize of input 44 treesize of output 35 [2022-11-26 00:50:53,419 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-11-26 00:50:53,420 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 2 case distinctions, treesize of input 80 treesize of output 70 [2022-11-26 00:50:53,435 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2022-11-26 00:50:53,435 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 17 treesize of output 17 [2022-11-26 00:50:53,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:50:53,449 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 28 treesize of output 25 [2022-11-26 00:50:53,572 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:50:53,572 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 54 treesize of output 51 [2022-11-26 00:50:53,583 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 43 treesize of output 43 [2022-11-26 00:50:53,592 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 25 treesize of output 17 [2022-11-26 00:50:53,812 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 33 treesize of output 21 [2022-11-26 00:50:53,818 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 28 treesize of output 16 [2022-11-26 00:50:53,844 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-11-26 00:50:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:53,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:50:53,904 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 69 treesize of output 49 [2022-11-26 00:50:53,916 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_397 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_397) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_399 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_399) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|))) is different from false [2022-11-26 00:50:53,968 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:53,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 103 treesize of output 96 [2022-11-26 00:50:53,981 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:53,981 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 87 treesize of output 64 [2022-11-26 00:50:54,010 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:54,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 315 treesize of output 230 [2022-11-26 00:50:54,048 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:50:54,049 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 402 treesize of output 369 [2022-11-26 00:50:54,068 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 353 treesize of output 341 [2022-11-26 00:50:54,080 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 341 treesize of output 337 [2022-11-26 00:50:54,092 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 337 treesize of output 333 [2022-11-26 00:50:54,105 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 333 treesize of output 323 [2022-11-26 00:50:54,117 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 323 treesize of output 279 [2022-11-26 00:50:54,129 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 279 treesize of output 267 [2022-11-26 00:50:54,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:50:54,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023251813] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:50:54,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 6 imperfect interpolant sequences. [2022-11-26 00:50:54,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 8, 8, 8] total 19 [2022-11-26 00:50:54,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524387745] [2022-11-26 00:50:54,550 INFO L85 oduleStraightlineAll]: Using 6 imperfect interpolants to construct interpolant automaton [2022-11-26 00:50:54,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 00:50:54,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2022-11-26 00:50:54,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 00:50:54,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=203, Unknown=3, NotChecked=90, Total=342 [2022-11-26 00:50:54,552 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:51:00,743 INFO L93 Difference]: Finished difference Result 89 states and 112 transitions. [2022-11-26 00:51:00,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-26 00:51:00,743 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-26 00:51:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:51:00,744 INFO L225 Difference]: With dead ends: 89 [2022-11-26 00:51:00,744 INFO L226 Difference]: Without dead ends: 87 [2022-11-26 00:51:00,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=80, Invalid=309, Unknown=3, NotChecked=114, Total=506 [2022-11-26 00:51:00,746 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 89 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-11-26 00:51:00,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 482 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 358 Invalid, 0 Unknown, 177 Unchecked, 5.9s Time] [2022-11-26 00:51:00,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-26 00:51:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2022-11-26 00:51:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.3559322033898304) internal successors, (80), 63 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 80 transitions. [2022-11-26 00:51:00,770 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 80 transitions. Word has length 18 [2022-11-26 00:51:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:51:00,770 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 80 transitions. [2022-11-26 00:51:00,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.789473684210526) internal successors, (53), 19 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:51:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 80 transitions. [2022-11-26 00:51:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:51:00,772 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:51:00,772 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:51:00,786 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:00,994 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:01,187 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:51:01,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/cvc4 --incremental --print-success --lang smt [2022-11-26 00:51:01,385 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] === [2022-11-26 00:51:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:51:01,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1688066150, now seen corresponding path program 1 times [2022-11-26 00:51:01,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2022-11-26 00:51:01,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000582271] [2022-11-26 00:51:01,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:51:01,386 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-26 00:51:01,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat [2022-11-26 00:51:01,388 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-26 00:51:01,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3df6daf3-e1ba-4604-8619-ba19bcce14c9/bin/utaipan-ByfvJB40ur/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-26 00:51:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:51:01,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 97 conjunts are in the unsatisfiable core [2022-11-26 00:51:01,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:51:01,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2022-11-26 00:51:01,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:01,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:01,890 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 0 case distinctions, treesize of input 34 treesize of output 24 [2022-11-26 00:51:01,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:01,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:01,904 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 0 case distinctions, treesize of input 42 treesize of output 28 [2022-11-26 00:51:01,936 INFO L321 Elim1Store]: treesize reduction 42, result has 10.6 percent of original size [2022-11-26 00:51:01,936 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 50 [2022-11-26 00:51:01,969 INFO L321 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2022-11-26 00:51:01,970 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 27 treesize of output 35 [2022-11-26 00:51:01,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-26 00:51:01,999 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-11-26 00:51:02,010 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-11-26 00:51:02,128 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:51:02,129 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 33 treesize of output 31 [2022-11-26 00:51:02,149 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-11-26 00:51:02,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,165 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-11-26 00:51:02,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,321 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-26 00:51:02,321 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 99 [2022-11-26 00:51:02,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,380 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2022-11-26 00:51:02,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 93 [2022-11-26 00:51:02,423 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-26 00:51:02,423 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 24 treesize of output 26 [2022-11-26 00:51:02,440 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-11-26 00:51:02,449 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2022-11-26 00:51:02,458 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 18 treesize of output 20 [2022-11-26 00:51:02,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,482 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-11-26 00:51:02,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,497 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 25 treesize of output 30 [2022-11-26 00:51:02,665 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-26 00:51:02,665 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-11-26 00:51:02,685 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-11-26 00:51:02,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:51:02,713 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-11-26 00:51:03,064 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:51:03,064 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 92 treesize of output 63 [2022-11-26 00:51:03,074 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:51:03,075 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 41 treesize of output 17 [2022-11-26 00:51:03,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:51:03,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:51:03,221 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_601) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_602) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_600) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (_ bv0 32))) is different from false [2022-11-26 00:51:03,513 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_565 (_ BitVec 32)) (v_ArrVal_584 (_ BitVec 32)) (v_ArrVal_600 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_601 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_602 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_584)))) (store .cse3 v_ArrVal_584 (store (select .cse3 v_ArrVal_584) (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.base|))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_565)) v_ArrVal_584 v_ArrVal_570) .cse0 v_ArrVal_601) (select (select (store .cse1 .cse0 v_ArrVal_602) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv8 32) (select (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32))))) (store .cse2 v_ArrVal_584 (store (select .cse2 v_ArrVal_584) (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) .cse0 v_ArrVal_600) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (_ bv0 32)) (not (= (select |c_#valid| v_ArrVal_584) (_ bv0 1))))) is different from false [2022-11-26 00:51:03,644 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:51:03,644 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 2 case distinctions, treesize of input 154 treesize of output 160 [2022-11-26 00:51:03,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:51:03,742 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 141 treesize of output 124 [2022-11-26 00:51:03,949 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:51:03,949 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 703 treesize of output 702 [2022-11-26 00:51:03,995 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:51:03,996 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 698 treesize of output 680 [2022-11-26 00:51:04,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 309 treesize of output 258 [2022-11-26 00:51:04,070 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 518 treesize of output 416 [2022-11-26 00:51:04,312 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 6 treesize of output 4 [2022-11-26 00:51:04,354 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 6 treesize of output 4 [2022-11-26 00:51:04,510 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select v_arrayElimArr_20 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_602 (Array (_ BitVec 32) (_ BitVec 32)))) (not (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20))) (store .cse2 .cse3 (store (select .cse2 .cse3) (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.base|))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_602) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse1))))) (not (= (select |c_#valid| .cse3) (_ bv0 1)))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select v_arrayElimArr_20 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_arrayElimArr_21 (Array (_ BitVec 32) (_ BitVec 32)))) (or (forall ((v_ArrVal_600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_21))) (store .cse4 .cse5 (store (select .cse4 .cse5) (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20))) (store .cse6 .cse5 (store (select .cse6 .cse5) (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.base|))) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_600) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (not (= (select v_arrayElimArr_21 |c_ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= (select |c_#valid| .cse5) (_ bv0 1)))))) (forall ((v_arrayElimArr_20 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (select v_arrayElimArr_20 |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_ArrVal_602 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_20))) (store .cse8 .cse9 (store (select .cse8 .cse9) (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.base|))))) (store .cse7 (select (select .cse7 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_602)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (not (= (select |c_#valid| .cse9) (_ bv0 1))))))) is different from false [2022-11-26 00:51:12,413 WARN L233 SmtUtils]: Spent 7.69s on a formula simplification. DAG size of input: 28 DAG size of output: 19 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-26 00:51:12,413 INFO L321 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2022-11-26 00:51:12,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 2121 treesize of output 1776 [2022-11-26 00:51:25,933 WARN L233 SmtUtils]: Spent 13.48s on a formula simplification. DAG size of input: 31 DAG size of output: 28 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-26 00:51:25,933 INFO L321 Elim1Store]: treesize reduction 19, result has 69.4 percent of original size [2022-11-26 00:51:25,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 1494 treesize of output 1399 [2022-11-26 00:53:37,200 WARN L233 SmtUtils]: Spent 2.14m on a formula simplification. DAG size of input: 208 DAG size of output: 204 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-26 00:53:37,202 INFO L321 Elim1Store]: treesize reduction 10, result has 98.0 percent of original size [2022-11-26 00:53:37,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 25786365 treesize of output 25304377 [2022-11-26 00:56:15,365 WARN L233 SmtUtils]: Spent 2.64m on a formula simplification. DAG size of input: 9292 DAG size of output: 9291 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-26 00:56:17,608 INFO L217 Elim1Store]: Index analysis took 191 ms [2022-11-26 00:56:49,411 WARN L233 SmtUtils]: Spent 31.74s on a formula simplification. DAG size of input: 145 DAG size of output: 94 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-26 00:56:49,412 INFO L321 Elim1Store]: treesize reduction 298, result has 42.4 percent of original size [2022-11-26 00:56:49,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 18 case distinctions, treesize of input 25312838 treesize of output 25312762 [2022-11-26 00:58:22,419 WARN L233 SmtUtils]: Spent 1.55m on a formula simplification that was a NOOP. DAG size: 9783 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-26 00:58:25,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:58:25,952 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 25314088 treesize of output 25312840 [2022-11-26 00:59:55,202 WARN L233 SmtUtils]: Spent 1.49m on a formula simplification that was a NOOP. DAG size: 9786 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-26 01:00:01,973 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:00:01,987 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 25747317 treesize of output 24989691