./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 12:28:54,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 12:28:54,057 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 12:28:54,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 12:28:54,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 12:28:54,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 12:28:54,071 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 12:28:54,073 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 12:28:54,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 12:28:54,074 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 12:28:54,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 12:28:54,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 12:28:54,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 12:28:54,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 12:28:54,077 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 12:28:54,078 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 12:28:54,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 12:28:54,079 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 12:28:54,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 12:28:54,081 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 12:28:54,082 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 12:28:54,084 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 12:28:54,086 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 12:28:54,087 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 12:28:54,089 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 12:28:54,090 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 12:28:54,090 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 12:28:54,090 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 12:28:54,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 12:28:54,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 12:28:54,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 12:28:54,092 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 12:28:54,093 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 12:28:54,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 12:28:54,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 12:28:54,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 12:28:54,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 12:28:54,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 12:28:54,095 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 12:28:54,096 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 12:28:54,096 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 12:28:54,097 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 12:28:54,110 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 12:28:54,111 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 12:28:54,111 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 12:28:54,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 12:28:54,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 12:28:54,112 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 12:28:54,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 12:28:54,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 12:28:54,112 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 12:28:54,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 12:28:54,113 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 12:28:54,113 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 12:28:54,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 12:28:54,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 12:28:54,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 12:28:54,113 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 12:28:54,113 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 12:28:54,113 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 12:28:54,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 12:28:54,114 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 12:28:54,114 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 12:28:54,114 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 12:28:54,114 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 12:28:54,114 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 12:28:54,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 12:28:54,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:28:54,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 12:28:54,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 12:28:54,115 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 12:28:54,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 12:28:54,115 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 12:28:54,115 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 12:28:54,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 12:28:54,115 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 12:28:54,116 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2022-12-13 12:28:54,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 12:28:54,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 12:28:54,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 12:28:54,314 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 12:28:54,315 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 12:28:54,316 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-12-13 12:28:56,978 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 12:28:57,157 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 12:28:57,158 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2022-12-13 12:28:57,165 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/data/77855cc39/1cddccc8bc9d4dd3a43cdbca7f54fe5c/FLAG777723b7b [2022-12-13 12:28:57,180 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/data/77855cc39/1cddccc8bc9d4dd3a43cdbca7f54fe5c [2022-12-13 12:28:57,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 12:28:57,183 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 12:28:57,184 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 12:28:57,184 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 12:28:57,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 12:28:57,187 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,188 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70d4a41b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57, skipping insertion in model container [2022-12-13 12:28:57,188 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 12:28:57,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 12:28:57,451 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_6f892be7-801d-4eed-9e81-686afd9ba062/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2022-12-13 12:28:57,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:28:57,463 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 12:28:57,500 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_6f892be7-801d-4eed-9e81-686afd9ba062/sv-benchmarks/c/list-simple/sll2n_append_unequal.i[24323,24336] [2022-12-13 12:28:57,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 12:28:57,522 INFO L208 MainTranslator]: Completed translation [2022-12-13 12:28:57,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57 WrapperNode [2022-12-13 12:28:57,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 12:28:57,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 12:28:57,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 12:28:57,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 12:28:57,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,559 INFO L138 Inliner]: procedures = 127, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2022-12-13 12:28:57,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 12:28:57,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 12:28:57,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 12:28:57,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 12:28:57,568 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,584 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,589 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 12:28:57,589 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 12:28:57,590 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 12:28:57,590 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 12:28:57,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (1/1) ... [2022-12-13 12:28:57,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 12:28:57,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:28:57,617 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 12:28:57,618 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 12:28:57,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 12:28:57,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 12:28:57,647 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 12:28:57,647 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 12:28:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 12:28:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 12:28:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 12:28:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 12:28:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 12:28:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 12:28:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 12:28:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 12:28:57,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 12:28:57,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 12:28:57,746 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 12:28:57,748 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 12:28:58,023 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 12:28:58,028 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 12:28:58,029 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 12:28:58,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:28:58 BoogieIcfgContainer [2022-12-13 12:28:58,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 12:28:58,033 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 12:28:58,033 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 12:28:58,036 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 12:28:58,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 12:28:57" (1/3) ... [2022-12-13 12:28:58,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ef9674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:28:58, skipping insertion in model container [2022-12-13 12:28:58,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 12:28:57" (2/3) ... [2022-12-13 12:28:58,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14ef9674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 12:28:58, skipping insertion in model container [2022-12-13 12:28:58,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 12:28:58" (3/3) ... [2022-12-13 12:28:58,039 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2022-12-13 12:28:58,054 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 12:28:58,054 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2022-12-13 12:28:58,086 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 12:28:58,091 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@433943d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 12:28:58,092 INFO L358 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2022-12-13 12:28:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:28:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 12:28:58,099 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:28:58,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:28:58,100 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:28:58,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:28:58,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520441, now seen corresponding path program 1 times [2022-12-13 12:28:58,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:28:58,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134063327] [2022-12-13 12:28:58,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:58,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:28:58,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:28:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:28:58,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134063327] [2022-12-13 12:28:58,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134063327] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:28:58,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:28:58,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:28:58,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513747709] [2022-12-13 12:28:58,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:28:58,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:28:58,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:28:58,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:28:58,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:28:58,306 INFO L87 Difference]: Start difference. First operand has 96 states, 53 states have (on average 2.0) internal successors, (106), 92 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:28:58,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:28:58,384 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-12-13 12:28:58,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:28:58,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 12:28:58,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:28:58,391 INFO L225 Difference]: With dead ends: 94 [2022-12-13 12:28:58,391 INFO L226 Difference]: Without dead ends: 91 [2022-12-13 12:28:58,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:28:58,395 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:28:58,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:28:58,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-12-13 12:28:58,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-12-13 12:28:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 87 states have internal predecessors, (95), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:28:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-12-13 12:28:58,420 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 7 [2022-12-13 12:28:58,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:28:58,421 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-12-13 12:28:58,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:28:58,421 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-12-13 12:28:58,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-13 12:28:58,421 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:28:58,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:28:58,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 12:28:58,422 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:28:58,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:28:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1814520442, now seen corresponding path program 1 times [2022-12-13 12:28:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:28:58,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829338827] [2022-12-13 12:28:58,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:58,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:28:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:58,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:28:58,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:28:58,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829338827] [2022-12-13 12:28:58,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829338827] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:28:58,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:28:58,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 12:28:58,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265417264] [2022-12-13 12:28:58,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:28:58,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 12:28:58,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:28:58,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 12:28:58,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:28:58,497 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:28:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:28:58,557 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-12-13 12:28:58,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 12:28:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-13 12:28:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:28:58,559 INFO L225 Difference]: With dead ends: 89 [2022-12-13 12:28:58,559 INFO L226 Difference]: Without dead ends: 89 [2022-12-13 12:28:58,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 12:28:58,561 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:28:58,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:28:58,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-12-13 12:28:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-12-13 12:28:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 51 states have (on average 1.8235294117647058) internal successors, (93), 85 states have internal predecessors, (93), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:28:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 97 transitions. [2022-12-13 12:28:58,569 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 97 transitions. Word has length 7 [2022-12-13 12:28:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:28:58,569 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 97 transitions. [2022-12-13 12:28:58,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 12:28:58,570 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-12-13 12:28:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 12:28:58,570 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:28:58,570 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:28:58,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 12:28:58,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:28:58,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:28:58,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468992, now seen corresponding path program 1 times [2022-12-13 12:28:58,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:28:58,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270920576] [2022-12-13 12:28:58,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:58,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:28:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:58,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:28:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:28:58,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:28:58,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270920576] [2022-12-13 12:28:58,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270920576] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:28:58,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:28:58,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:28:58,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961473402] [2022-12-13 12:28:58,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:28:58,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:28:58,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:28:58,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:28:58,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:28:58,730 INFO L87 Difference]: Start difference. First operand 89 states and 97 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:28:58,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:28:58,898 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2022-12-13 12:28:58,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:28:58,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-13 12:28:58,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:28:58,901 INFO L225 Difference]: With dead ends: 93 [2022-12-13 12:28:58,901 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 12:28:58,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:28:58,902 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 11 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:28:58,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 345 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:28:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 12:28:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-12-13 12:28:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 51 states have (on average 1.803921568627451) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:28:58,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-12-13 12:28:58,911 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 13 [2022-12-13 12:28:58,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:28:58,911 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-12-13 12:28:58,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:28:58,911 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-12-13 12:28:58,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-13 12:28:58,912 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:28:58,912 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:28:58,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 12:28:58,912 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:28:58,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:28:58,913 INFO L85 PathProgramCache]: Analyzing trace with hash -2099468991, now seen corresponding path program 1 times [2022-12-13 12:28:58,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:28:58,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812728127] [2022-12-13 12:28:58,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:58,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:28:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:59,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:28:59,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:59,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:28:59,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:28:59,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812728127] [2022-12-13 12:28:59,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812728127] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:28:59,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:28:59,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:28:59,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685765517] [2022-12-13 12:28:59,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:28:59,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:28:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:28:59,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:28:59,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:28:59,131 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:28:59,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:28:59,314 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-12-13 12:28:59,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 12:28:59,314 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-12-13 12:28:59,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:28:59,315 INFO L225 Difference]: With dead ends: 92 [2022-12-13 12:28:59,315 INFO L226 Difference]: Without dead ends: 92 [2022-12-13 12:28:59,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:28:59,316 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 9 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:28:59,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 361 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:28:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-13 12:28:59,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2022-12-13 12:28:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 51 states have (on average 1.7843137254901962) internal successors, (91), 83 states have internal predecessors, (91), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:28:59,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-12-13 12:28:59,320 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 13 [2022-12-13 12:28:59,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:28:59,320 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-12-13 12:28:59,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:28:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-12-13 12:28:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 12:28:59,321 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:28:59,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:28:59,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 12:28:59,322 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:28:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:28:59,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1633295936, now seen corresponding path program 1 times [2022-12-13 12:28:59,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:28:59,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081188637] [2022-12-13 12:28:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:28:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:59,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-12-13 12:28:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:59,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:28:59,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:28:59,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081188637] [2022-12-13 12:28:59,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081188637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:28:59,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:28:59,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 12:28:59,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759620523] [2022-12-13 12:28:59,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:28:59,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 12:28:59,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:28:59,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 12:28:59,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:28:59,373 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:28:59,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:28:59,442 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2022-12-13 12:28:59,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 12:28:59,443 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-12-13 12:28:59,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:28:59,443 INFO L225 Difference]: With dead ends: 93 [2022-12-13 12:28:59,444 INFO L226 Difference]: Without dead ends: 93 [2022-12-13 12:28:59,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 12:28:59,445 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:28:59,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 222 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:28:59,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-12-13 12:28:59,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2022-12-13 12:28:59,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.7692307692307692) internal successors, (92), 84 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:28:59,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2022-12-13 12:28:59,450 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 15 [2022-12-13 12:28:59,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:28:59,450 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2022-12-13 12:28:59,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 12:28:59,451 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2022-12-13 12:28:59,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 12:28:59,451 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:28:59,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:28:59,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 12:28:59,452 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:28:59,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:28:59,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1411001534, now seen corresponding path program 1 times [2022-12-13 12:28:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:28:59,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895424171] [2022-12-13 12:28:59,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:59,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:28:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:59,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:28:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:59,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-12-13 12:28:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:59,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:28:59,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:28:59,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895424171] [2022-12-13 12:28:59,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895424171] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:28:59,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4432401] [2022-12-13 12:28:59,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:28:59,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:28:59,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:28:59,559 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:28:59,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 12:28:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:28:59,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 12:28:59,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:28:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:28:59,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:28:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:28:59,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4432401] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:28:59,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:28:59,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-12-13 12:28:59,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578592783] [2022-12-13 12:28:59,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:28:59,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:28:59,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:28:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:28:59,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:28:59,725 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 12:28:59,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:28:59,800 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-12-13 12:28:59,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:28:59,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-12-13 12:28:59,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:28:59,802 INFO L225 Difference]: With dead ends: 94 [2022-12-13 12:28:59,802 INFO L226 Difference]: Without dead ends: 94 [2022-12-13 12:28:59,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:28:59,803 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 4 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:28:59,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 310 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:28:59,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-12-13 12:28:59,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-12-13 12:28:59,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 89 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:28:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-12-13 12:28:59,809 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 28 [2022-12-13 12:28:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:28:59,810 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-12-13 12:28:59,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 12:28:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-12-13 12:28:59,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 12:28:59,811 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:28:59,811 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:28:59,818 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 12:29:00,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:00,012 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:00,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:00,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092864, now seen corresponding path program 2 times [2022-12-13 12:29:00,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:00,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911334672] [2022-12-13 12:29:00,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:00,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:00,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:00,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:00,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:00,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:00,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:00,418 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-12-13 12:29:00,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:00,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911334672] [2022-12-13 12:29:00,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911334672] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:00,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:00,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:29:00,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093051946] [2022-12-13 12:29:00,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:00,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:29:00,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:00,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:29:00,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:29:00,420 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:29:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:00,566 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-12-13 12:29:00,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:29:00,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-12-13 12:29:00,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:00,567 INFO L225 Difference]: With dead ends: 101 [2022-12-13 12:29:00,567 INFO L226 Difference]: Without dead ends: 101 [2022-12-13 12:29:00,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 12:29:00,568 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 136 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:00,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 198 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:29:00,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-13 12:29:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2022-12-13 12:29:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 84 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2022-12-13 12:29:00,574 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 41 [2022-12-13 12:29:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:00,574 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2022-12-13 12:29:00,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:29:00,575 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2022-12-13 12:29:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 12:29:00,575 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:00,576 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:00,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 12:29:00,576 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:00,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1367092863, now seen corresponding path program 1 times [2022-12-13 12:29:00,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:00,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923311956] [2022-12-13 12:29:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:00,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:00,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:01,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:01,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 12:29:01,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:01,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923311956] [2022-12-13 12:29:01,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923311956] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:01,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855717317] [2022-12-13 12:29:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:01,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:01,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:01,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:01,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 12:29:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:01,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 12:29:01,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:01,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:29:01,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:01,302 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-12-13 12:29:01,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:01,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:29:01,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:01,403 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-12-13 12:29:01,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:01,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:29:01,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:01,497 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-12-13 12:29:01,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:01,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:29:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-12-13 12:29:01,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:01,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855717317] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:01,658 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:01,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2022-12-13 12:29:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602415930] [2022-12-13 12:29:01,659 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-13 12:29:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-13 12:29:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=145, Unknown=3, NotChecked=78, Total=272 [2022-12-13 12:29:01,660 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 12:29:01,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:01,940 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2022-12-13 12:29:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:29:01,940 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 41 [2022-12-13 12:29:01,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:01,941 INFO L225 Difference]: With dead ends: 96 [2022-12-13 12:29:01,941 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 12:29:01,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=187, Unknown=3, NotChecked=90, Total=342 [2022-12-13 12:29:01,942 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 235 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:01,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 224 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 314 Invalid, 0 Unknown, 237 Unchecked, 0.2s Time] [2022-12-13 12:29:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 12:29:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 84. [2022-12-13 12:29:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5263157894736843) internal successors, (87), 79 states have internal predecessors, (87), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2022-12-13 12:29:01,947 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 41 [2022-12-13 12:29:01,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:01,948 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2022-12-13 12:29:01,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 3 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 12:29:01,948 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2022-12-13 12:29:01,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 12:29:01,949 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:01,949 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:01,953 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 12:29:02,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-12-13 12:29:02,151 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:02,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:02,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1027760007, now seen corresponding path program 1 times [2022-12-13 12:29:02,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:02,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788990282] [2022-12-13 12:29:02,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:02,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:02,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:02,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:29:03,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:03,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788990282] [2022-12-13 12:29:03,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788990282] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:03,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16673642] [2022-12-13 12:29:03,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:03,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:03,093 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:03,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:03,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 12:29:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:03,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 12:29:03,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:03,520 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 19 treesize of output 11 [2022-12-13 12:29:03,524 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 7 treesize of output 3 [2022-12-13 12:29:03,643 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_616) |c_#memory_$Pointer$.offset|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_615)))) is different from true [2022-12-13 12:29:03,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:03,679 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 25 treesize of output 25 [2022-12-13 12:29:03,689 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:29:03,689 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-12-13 12:29:03,694 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 18 treesize of output 13 [2022-12-13 12:29:03,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:03,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 12:29:03,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:29:03,755 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 17 treesize of output 9 [2022-12-13 12:29:03,804 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 12:29:03,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:04,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16673642] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:04,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:04,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2022-12-13 12:29:04,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068904846] [2022-12-13 12:29:04,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:04,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-12-13 12:29:04,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:04,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-12-13 12:29:04,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1084, Unknown=1, NotChecked=66, Total=1260 [2022-12-13 12:29:04,739 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 12:29:05,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:05,963 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2022-12-13 12:29:05,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-13 12:29:05,963 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2022-12-13 12:29:05,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:05,964 INFO L225 Difference]: With dead ends: 134 [2022-12-13 12:29:05,964 INFO L226 Difference]: Without dead ends: 134 [2022-12-13 12:29:05,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=241, Invalid=2018, Unknown=1, NotChecked=92, Total=2352 [2022-12-13 12:29:05,965 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 421 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1250 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:05,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1191 Invalid, 1399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1250 Invalid, 0 Unknown, 140 Unchecked, 0.7s Time] [2022-12-13 12:29:05,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-12-13 12:29:05,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 88. [2022-12-13 12:29:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 83 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2022-12-13 12:29:05,968 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 45 [2022-12-13 12:29:05,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:05,968 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2022-12-13 12:29:05,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 28 states have internal predecessors, (68), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 12:29:05,968 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2022-12-13 12:29:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 12:29:05,969 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:05,969 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:05,974 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-13 12:29:06,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:06,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:06,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:06,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1027760006, now seen corresponding path program 1 times [2022-12-13 12:29:06,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:06,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270784091] [2022-12-13 12:29:06,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:06,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:06,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:29:06,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:06,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270784091] [2022-12-13 12:29:06,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270784091] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:06,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825261338] [2022-12-13 12:29:06,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:06,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:06,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:06,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:06,628 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 12:29:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:06,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 12:29:06,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:06,880 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 9 treesize of output 5 [2022-12-13 12:29:06,964 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_784 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_784) |c_#memory_$Pointer$.base|)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 12:29:06,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:06,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 12:29:06,995 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-13 12:29:06,995 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 12:29:07,055 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 17 treesize of output 9 [2022-12-13 12:29:07,072 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-12-13 12:29:07,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:29:07,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825261338] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:07,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:29:07,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 26 [2022-12-13 12:29:07,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394826286] [2022-12-13 12:29:07,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:07,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-13 12:29:07,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:07,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-13 12:29:07,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=575, Unknown=2, NotChecked=48, Total=702 [2022-12-13 12:29:07,075 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:29:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:07,432 INFO L93 Difference]: Finished difference Result 126 states and 141 transitions. [2022-12-13 12:29:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 12:29:07,432 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-12-13 12:29:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:07,433 INFO L225 Difference]: With dead ends: 126 [2022-12-13 12:29:07,433 INFO L226 Difference]: Without dead ends: 126 [2022-12-13 12:29:07,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=811, Unknown=2, NotChecked=58, Total=992 [2022-12-13 12:29:07,434 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 73 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 4 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 159 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:07,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 722 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 574 Invalid, 3 Unknown, 159 Unchecked, 0.3s Time] [2022-12-13 12:29:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-12-13 12:29:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 86. [2022-12-13 12:29:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 61 states have (on average 1.4754098360655739) internal successors, (90), 81 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-12-13 12:29:07,439 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 45 [2022-12-13 12:29:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:07,439 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-12-13 12:29:07,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:29:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-12-13 12:29:07,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 12:29:07,440 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:07,440 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:07,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 12:29:07,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-13 12:29:07,642 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:07,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:07,644 INFO L85 PathProgramCache]: Analyzing trace with hash -312140221, now seen corresponding path program 1 times [2022-12-13 12:29:07,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:07,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911405301] [2022-12-13 12:29:07,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:07,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:07,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:07,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:07,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:07,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-12-13 12:29:07,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:07,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911405301] [2022-12-13 12:29:07,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911405301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:07,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:07,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:29:07,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809778411] [2022-12-13 12:29:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:07,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:29:07,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:29:07,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:29:07,902 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:29:08,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:08,101 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2022-12-13 12:29:08,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 12:29:08,102 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-12-13 12:29:08,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:08,103 INFO L225 Difference]: With dead ends: 135 [2022-12-13 12:29:08,103 INFO L226 Difference]: Without dead ends: 135 [2022-12-13 12:29:08,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:29:08,103 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 220 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:08,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 333 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:29:08,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-12-13 12:29:08,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 88. [2022-12-13 12:29:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 83 states have internal predecessors, (94), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:08,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 100 transitions. [2022-12-13 12:29:08,106 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 100 transitions. Word has length 47 [2022-12-13 12:29:08,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:08,107 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 100 transitions. [2022-12-13 12:29:08,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:29:08,107 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 100 transitions. [2022-12-13 12:29:08,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 12:29:08,108 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:08,108 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:08,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 12:29:08,109 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:08,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:08,109 INFO L85 PathProgramCache]: Analyzing trace with hash -312140220, now seen corresponding path program 1 times [2022-12-13 12:29:08,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:08,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386204635] [2022-12-13 12:29:08,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:08,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:08,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:08,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:08,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:08,416 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-12-13 12:29:08,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:08,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386204635] [2022-12-13 12:29:08,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386204635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:29:08,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:29:08,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 12:29:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031362998] [2022-12-13 12:29:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:29:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 12:29:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 12:29:08,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:29:08,418 INFO L87 Difference]: Start difference. First operand 88 states and 100 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:29:08,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:08,677 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2022-12-13 12:29:08,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 12:29:08,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 47 [2022-12-13 12:29:08,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:08,678 INFO L225 Difference]: With dead ends: 146 [2022-12-13 12:29:08,679 INFO L226 Difference]: Without dead ends: 146 [2022-12-13 12:29:08,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-12-13 12:29:08,679 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 190 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:08,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 384 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 12:29:08,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-13 12:29:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2022-12-13 12:29:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 73 states have (on average 1.3972602739726028) internal successors, (102), 90 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:08,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2022-12-13 12:29:08,682 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 47 [2022-12-13 12:29:08,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:08,683 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2022-12-13 12:29:08,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 12:29:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2022-12-13 12:29:08,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 12:29:08,684 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:08,684 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:08,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 12:29:08,685 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:08,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:08,685 INFO L85 PathProgramCache]: Analyzing trace with hash 241565309, now seen corresponding path program 1 times [2022-12-13 12:29:08,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:08,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588223911] [2022-12-13 12:29:08,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:08,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:09,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:09,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:09,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:09,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:29:10,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:10,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588223911] [2022-12-13 12:29:10,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588223911] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:10,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473104967] [2022-12-13 12:29:10,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:10,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:10,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:10,264 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:10,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 12:29:10,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:10,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 108 conjunts are in the unsatisfiable core [2022-12-13 12:29:10,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:10,680 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 12:29:10,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 12:29:10,697 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 12:29:10,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 12:29:10,843 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:29:10,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:29:11,152 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:29:11,152 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 38 [2022-12-13 12:29:11,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:29:11,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 16 [2022-12-13 12:29:11,332 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1157 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1157) |c_#memory_$Pointer$.offset|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1153 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1153) |c_#length|)) (exists ((v_ArrVal_1156 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1156) |c_#memory_$Pointer$.base|)))) is different from true [2022-12-13 12:29:11,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:11,385 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:29:11,385 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 69 [2022-12-13 12:29:11,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:11,395 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:11,398 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:29:11,398 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 50 treesize of output 49 [2022-12-13 12:29:11,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:11,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-12-13 12:29:11,429 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 12:29:11,429 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 28 treesize of output 30 [2022-12-13 12:29:11,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:11,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:29:11,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:29:11,727 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 87 treesize of output 47 [2022-12-13 12:29:11,734 INFO L321 Elim1Store]: treesize reduction 18, result has 14.3 percent of original size [2022-12-13 12:29:11,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 27 [2022-12-13 12:29:11,811 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 12:29:11,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:12,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473104967] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:12,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:12,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 22] total 48 [2022-12-13 12:29:12,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865298011] [2022-12-13 12:29:12,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:12,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-13 12:29:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:12,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-13 12:29:12,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2496, Unknown=2, NotChecked=100, Total=2756 [2022-12-13 12:29:12,224 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:29:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:17,142 INFO L93 Difference]: Finished difference Result 212 states and 238 transitions. [2022-12-13 12:29:17,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 12:29:17,142 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2022-12-13 12:29:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:17,143 INFO L225 Difference]: With dead ends: 212 [2022-12-13 12:29:17,143 INFO L226 Difference]: Without dead ends: 212 [2022-12-13 12:29:17,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=698, Invalid=5466, Unknown=2, NotChecked=154, Total=6320 [2022-12-13 12:29:17,144 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 1495 mSDsluCounter, 1467 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:17,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 1525 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2310 Invalid, 0 Unknown, 213 Unchecked, 1.6s Time] [2022-12-13 12:29:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-12-13 12:29:17,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 94. [2022-12-13 12:29:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.3783783783783783) internal successors, (102), 89 states have internal predecessors, (102), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:17,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2022-12-13 12:29:17,147 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 49 [2022-12-13 12:29:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:17,147 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2022-12-13 12:29:17,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 43 states have internal predecessors, (85), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:29:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-12-13 12:29:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 12:29:17,148 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:17,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:17,153 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 12:29:17,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-13 12:29:17,349 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:17,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash 241565308, now seen corresponding path program 1 times [2022-12-13 12:29:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:17,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954853772] [2022-12-13 12:29:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:17,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:17,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:17,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:17,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:18,428 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 16 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:29:18,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:18,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954853772] [2022-12-13 12:29:18,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954853772] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:18,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707626236] [2022-12-13 12:29:18,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:18,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:18,428 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:18,429 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:18,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 12:29:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:18,543 INFO L263 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 95 conjunts are in the unsatisfiable core [2022-12-13 12:29:18,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:18,731 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-12-13 12:29:18,731 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 19 treesize of output 16 [2022-12-13 12:29:18,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:29:19,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:19,036 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:29:19,036 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 18 [2022-12-13 12:29:19,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:29:19,169 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1329 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1329))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1330 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1330))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 12:29:19,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:19,206 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:29:19,206 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-12-13 12:29:19,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:19,211 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 62 treesize of output 58 [2022-12-13 12:29:19,237 INFO L321 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2022-12-13 12:29:19,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 69 [2022-12-13 12:29:19,389 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 81 treesize of output 57 [2022-12-13 12:29:19,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:19,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:29:19,578 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 29 [2022-12-13 12:29:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 23 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-12-13 12:29:19,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:19,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707626236] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:19,916 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:19,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22] total 45 [2022-12-13 12:29:19,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750357054] [2022-12-13 12:29:19,916 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:19,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-12-13 12:29:19,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:19,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-12-13 12:29:19,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2177, Unknown=2, NotChecked=94, Total=2450 [2022-12-13 12:29:19,918 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:29:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:22,505 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-12-13 12:29:22,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 12:29:22,505 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2022-12-13 12:29:22,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:22,506 INFO L225 Difference]: With dead ends: 141 [2022-12-13 12:29:22,506 INFO L226 Difference]: Without dead ends: 141 [2022-12-13 12:29:22,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=528, Invalid=4164, Unknown=4, NotChecked=134, Total=4830 [2022-12-13 12:29:22,508 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 745 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 1483 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:22,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 1483 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1495 Invalid, 3 Unknown, 133 Unchecked, 0.9s Time] [2022-12-13 12:29:22,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-12-13 12:29:22,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 94. [2022-12-13 12:29:22,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 74 states have (on average 1.364864864864865) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2022-12-13 12:29:22,510 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 49 [2022-12-13 12:29:22,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:22,510 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2022-12-13 12:29:22,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.930232558139535) internal successors, (83), 40 states have internal predecessors, (83), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:29:22,511 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-12-13 12:29:22,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 12:29:22,511 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:22,511 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:22,516 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 12:29:22,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:22,712 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:22,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:22,712 INFO L85 PathProgramCache]: Analyzing trace with hash -365046387, now seen corresponding path program 1 times [2022-12-13 12:29:22,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:22,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337131543] [2022-12-13 12:29:22,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:22,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:22,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:22,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:22,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:23,054 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:29:23,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337131543] [2022-12-13 12:29:23,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337131543] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:23,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687389234] [2022-12-13 12:29:23,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:23,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:23,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:23,056 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:23,057 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 12:29:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:23,187 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-13 12:29:23,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:23,340 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 17 treesize of output 9 [2022-12-13 12:29:23,392 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_1507 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1507)))) is different from true [2022-12-13 12:29:23,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:23,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-13 12:29:23,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:29:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 12:29:23,458 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:23,512 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1511 (Array Int Int)) (|v_node_create_~temp~0#1.base_31| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_31| v_ArrVal_1511) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_31| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2022-12-13 12:29:23,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687389234] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:23,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:23,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-12-13 12:29:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429399850] [2022-12-13 12:29:23,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:23,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-13 12:29:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:23,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-13 12:29:23,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-12-13 12:29:23,520 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 26 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 12:29:23,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:23,966 INFO L93 Difference]: Finished difference Result 82 states and 92 transitions. [2022-12-13 12:29:23,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 12:29:23,966 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 50 [2022-12-13 12:29:23,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:23,967 INFO L225 Difference]: With dead ends: 82 [2022-12-13 12:29:23,967 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 12:29:23,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=172, Invalid=956, Unknown=2, NotChecked=130, Total=1260 [2022-12-13 12:29:23,968 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 328 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:23,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 626 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 455 Invalid, 0 Unknown, 79 Unchecked, 0.2s Time] [2022-12-13 12:29:23,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 12:29:23,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-12-13 12:29:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 77 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:23,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 92 transitions. [2022-12-13 12:29:23,969 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 92 transitions. Word has length 50 [2022-12-13 12:29:23,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:23,970 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 92 transitions. [2022-12-13 12:29:23,970 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 22 states have internal predecessors, (65), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 12:29:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 92 transitions. [2022-12-13 12:29:23,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 12:29:23,970 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:23,970 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:23,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 12:29:24,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 12:29:24,173 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:24,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash 165492146, now seen corresponding path program 1 times [2022-12-13 12:29:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:24,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487118790] [2022-12-13 12:29:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:24,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:24,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:24,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:24,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:24,602 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 2 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:29:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:24,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487118790] [2022-12-13 12:29:24,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487118790] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:24,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743055357] [2022-12-13 12:29:24,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:24,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:24,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:24,603 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:24,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 12:29:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:24,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-13 12:29:24,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:24,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:29:24,763 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:24,778 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1679 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1679))) is different from true [2022-12-13 12:29:24,784 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1679 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1679))) is different from true [2022-12-13 12:29:24,795 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 12:29:24,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 12:29:24,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:24,905 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:29:24,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:29:25,107 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 18 treesize of output 10 [2022-12-13 12:29:25,203 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1680 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1680))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1682 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1682) |c_#memory_$Pointer$.base|)))) is different from true [2022-12-13 12:29:25,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:25,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-12-13 12:29:25,241 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 12:29:25,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 12:29:25,369 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:29:25,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-12-13 12:29:25,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-12-13 12:29:25,402 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 15 not checked. [2022-12-13 12:29:25,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:25,410 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1683 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1683) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 12:29:25,417 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1683 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_1683) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 12:29:25,498 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1689 (Array Int Int)) (v_ArrVal_1690 Int) (v_ArrVal_1683 (Array Int Int)) (|v_node_create_~temp~0#1.base_34| Int)) (or (not (< |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_34|) 0)) (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_34| v_ArrVal_1690) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_1689))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) v_ArrVal_1683)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1))) is different from false [2022-12-13 12:29:25,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743055357] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:25,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:25,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 42 [2022-12-13 12:29:25,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57077221] [2022-12-13 12:29:25,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:25,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-13 12:29:25,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:25,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-13 12:29:25,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1496, Unknown=14, NotChecked=498, Total=2162 [2022-12-13 12:29:25,501 INFO L87 Difference]: Start difference. First operand 82 states and 92 transitions. Second operand has 43 states, 40 states have (on average 2.125) internal successors, (85), 37 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 12:29:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:26,252 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2022-12-13 12:29:26,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 12:29:26,253 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 2.125) internal successors, (85), 37 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-12-13 12:29:26,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:26,254 INFO L225 Difference]: With dead ends: 146 [2022-12-13 12:29:26,254 INFO L226 Difference]: Without dead ends: 146 [2022-12-13 12:29:26,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 841 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=464, Invalid=2852, Unknown=14, NotChecked=702, Total=4032 [2022-12-13 12:29:26,257 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1448 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 31 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1448 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 237 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:26,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1448 Valid, 574 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 826 Invalid, 3 Unknown, 237 Unchecked, 0.3s Time] [2022-12-13 12:29:26,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-13 12:29:26,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 87. [2022-12-13 12:29:26,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.373134328358209) internal successors, (92), 82 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2022-12-13 12:29:26,260 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 51 [2022-12-13 12:29:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:26,260 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2022-12-13 12:29:26,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 2.125) internal successors, (85), 37 states have internal predecessors, (85), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 12:29:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2022-12-13 12:29:26,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 12:29:26,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:26,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:26,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 12:29:26,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 12:29:26,463 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:26,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:26,464 INFO L85 PathProgramCache]: Analyzing trace with hash 165492147, now seen corresponding path program 1 times [2022-12-13 12:29:26,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:26,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938438720] [2022-12-13 12:29:26,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:26,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:26,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:26,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:26,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:29:27,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:27,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938438720] [2022-12-13 12:29:27,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938438720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:27,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741134408] [2022-12-13 12:29:27,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:27,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:27,134 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:27,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 12:29:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:27,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 12:29:27,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:27,577 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 34 treesize of output 22 [2022-12-13 12:29:27,580 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 21 treesize of output 13 [2022-12-13 12:29:27,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:27,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:27,695 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1857 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1857))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_1860 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_1860))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_1861 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_1861))))) is different from true [2022-12-13 12:29:27,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:27,726 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 40 treesize of output 38 [2022-12-13 12:29:27,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:27,733 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 22 treesize of output 24 [2022-12-13 12:29:27,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:27,739 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 31 treesize of output 31 [2022-12-13 12:29:27,745 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:29:27,745 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-12-13 12:29:27,913 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:29:27,913 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 45 treesize of output 44 [2022-12-13 12:29:27,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:27,917 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 35 treesize of output 35 [2022-12-13 12:29:27,960 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 32 treesize of output 20 [2022-12-13 12:29:27,963 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 28 treesize of output 16 [2022-12-13 12:29:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 3 not checked. [2022-12-13 12:29:28,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:28,046 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1863 (Array Int Int)) (v_ArrVal_1862 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1862) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1863 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_1863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2022-12-13 12:29:28,060 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1863 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_1863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (forall ((v_ArrVal_1863 (Array Int Int)) (v_ArrVal_1862 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_1863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base| v_ArrVal_1862) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-12-13 12:29:28,068 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (and (forall ((v_ArrVal_1863 (Array Int Int)) (v_ArrVal_1862 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1862) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_1863 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1863) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-12-13 12:29:28,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741134408] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:28,251 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:28,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2022-12-13 12:29:28,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611801417] [2022-12-13 12:29:28,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:28,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-12-13 12:29:28,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:28,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-12-13 12:29:28,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1510, Unknown=5, NotChecked=324, Total=1980 [2022-12-13 12:29:28,253 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 12:29:29,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:29,886 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2022-12-13 12:29:29,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-13 12:29:29,887 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-12-13 12:29:29,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:29,888 INFO L225 Difference]: With dead ends: 143 [2022-12-13 12:29:29,888 INFO L226 Difference]: Without dead ends: 143 [2022-12-13 12:29:29,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=423, Invalid=3245, Unknown=8, NotChecked=484, Total=4160 [2022-12-13 12:29:29,890 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 884 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 1069 mSolverCounterSat, 28 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1069 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:29,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 866 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1069 Invalid, 3 Unknown, 110 Unchecked, 0.6s Time] [2022-12-13 12:29:29,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-13 12:29:29,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 93. [2022-12-13 12:29:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 88 states have internal predecessors, (98), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:29:29,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 104 transitions. [2022-12-13 12:29:29,893 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 104 transitions. Word has length 51 [2022-12-13 12:29:29,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:29,893 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 104 transitions. [2022-12-13 12:29:29,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 2.2162162162162162) internal successors, (82), 36 states have internal predecessors, (82), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 12:29:29,893 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 104 transitions. [2022-12-13 12:29:29,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 12:29:29,893 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:29,893 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:29,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-13 12:29:30,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 12:29:30,095 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:30,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1444229747, now seen corresponding path program 2 times [2022-12-13 12:29:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:30,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364446965] [2022-12-13 12:29:30,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:30,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:31,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:29:31,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:31,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364446965] [2022-12-13 12:29:31,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364446965] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:31,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [33740919] [2022-12-13 12:29:31,950 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:29:31,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:31,950 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:31,951 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:31,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 12:29:32,104 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:29:32,104 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:29:32,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 148 conjunts are in the unsatisfiable core [2022-12-13 12:29:32,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:32,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:29:32,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:29:32,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:29:32,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:29:32,682 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 12:29:32,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2022-12-13 12:29:32,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:29:32,695 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-13 12:29:32,695 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 24 treesize of output 27 [2022-12-13 12:29:32,713 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-12-13 12:29:32,714 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 19 treesize of output 16 [2022-12-13 12:29:32,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:29:32,870 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 30 treesize of output 25 [2022-12-13 12:29:32,877 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:29:32,878 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 36 treesize of output 31 [2022-12-13 12:29:33,296 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-13 12:29:33,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 60 [2022-12-13 12:29:33,306 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:29:33,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 18 [2022-12-13 12:29:33,426 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2050 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2049 (Array Int Int))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2049)) (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2050)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 12:29:33,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:33,476 INFO L321 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-12-13 12:29:33,477 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 117 treesize of output 101 [2022-12-13 12:29:33,496 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 12:29:33,496 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 28 treesize of output 30 [2022-12-13 12:29:33,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:33,505 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-13 12:29:33,506 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 76 [2022-12-13 12:29:34,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:34,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:29:34,431 INFO L321 Elim1Store]: treesize reduction 89, result has 11.0 percent of original size [2022-12-13 12:29:34,432 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 165 treesize of output 100 [2022-12-13 12:29:34,451 INFO L321 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-12-13 12:29:34,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 37 [2022-12-13 12:29:34,504 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 12:29:34,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:35,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [33740919] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:35,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:35,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31] total 54 [2022-12-13 12:29:35,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284654031] [2022-12-13 12:29:35,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:35,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-12-13 12:29:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:35,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-12-13 12:29:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=3457, Unknown=1, NotChecked=118, Total=3782 [2022-12-13 12:29:35,446 INFO L87 Difference]: Start difference. First operand 93 states and 104 transitions. Second operand has 54 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 48 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:29:39,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:39,272 INFO L93 Difference]: Finished difference Result 118 states and 134 transitions. [2022-12-13 12:29:39,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-13 12:29:39,272 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 48 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-12-13 12:29:39,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:39,273 INFO L225 Difference]: With dead ends: 118 [2022-12-13 12:29:39,273 INFO L226 Difference]: Without dead ends: 118 [2022-12-13 12:29:39,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1708 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=505, Invalid=5978, Unknown=1, NotChecked=158, Total=6642 [2022-12-13 12:29:39,276 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 118 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1492 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:39,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1492 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1556 Invalid, 0 Unknown, 100 Unchecked, 1.2s Time] [2022-12-13 12:29:39,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-12-13 12:29:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 113. [2022-12-13 12:29:39,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 106 states have internal predecessors, (118), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 12:29:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 128 transitions. [2022-12-13 12:29:39,281 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 128 transitions. Word has length 53 [2022-12-13 12:29:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:39,281 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 128 transitions. [2022-12-13 12:29:39,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.6153846153846154) internal successors, (84), 48 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:29:39,282 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 128 transitions. [2022-12-13 12:29:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-12-13 12:29:39,282 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:39,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:39,287 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 12:29:39,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-13 12:29:39,484 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash -445852738, now seen corresponding path program 1 times [2022-12-13 12:29:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:39,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851197934] [2022-12-13 12:29:39,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:40,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:40,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:40,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:40,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:40,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:40,468 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:29:40,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:40,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851197934] [2022-12-13 12:29:40,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851197934] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:40,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639896412] [2022-12-13 12:29:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:40,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:40,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:40,469 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:40,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 12:29:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:40,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 100 conjunts are in the unsatisfiable core [2022-12-13 12:29:40,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:40,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:29:40,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:40,668 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2226 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2226))) is different from true [2022-12-13 12:29:40,674 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2226 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2226))) is different from true [2022-12-13 12:29:40,685 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 12:29:40,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 12:29:40,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:40,827 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:29:40,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:29:41,036 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 7 treesize of output 3 [2022-12-13 12:29:41,038 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 8 treesize of output 4 [2022-12-13 12:29:41,103 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2227 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2227))) (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2228 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2228) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:29:41,110 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2229 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_2229))) (exists ((v_ArrVal_2230 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_2230)))) is different from true [2022-12-13 12:29:41,116 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_#res#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2230 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| v_ArrVal_2230))) (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2229 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| v_ArrVal_2229)))) is different from true [2022-12-13 12:29:41,134 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:41,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-12-13 12:29:41,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:41,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 12:29:41,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:41,383 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2022-12-13 12:29:41,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2022-12-13 12:29:41,444 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 52 treesize of output 36 [2022-12-13 12:29:41,534 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:29:41,535 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 20 [2022-12-13 12:29:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 16 not checked. [2022-12-13 12:29:41,562 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:42,026 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| Int) (v_ArrVal_2233 (Array Int Int)) (v_ArrVal_2241 (Array Int Int)) (v_ArrVal_2240 (Array Int Int))) (or (not (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| v_ArrVal_2240))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| v_ArrVal_2241)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (store (select .cse1 .cse2) (+ 4 (select (select .cse3 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27|)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse3 .cse2 v_ArrVal_2233) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) 0)) (= |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| 0) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_27| |c_#StackHeapBarrier|)))) is different from false [2022-12-13 12:29:42,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639896412] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:42,028 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:42,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 28] total 51 [2022-12-13 12:29:42,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925230895] [2022-12-13 12:29:42,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:42,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-12-13 12:29:42,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:42,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-12-13 12:29:42,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2611, Unknown=11, NotChecked=642, Total=3422 [2022-12-13 12:29:42,030 INFO L87 Difference]: Start difference. First operand 113 states and 128 transitions. Second operand has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 43 states have internal predecessors, (92), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:29:44,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:44,298 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-12-13 12:29:44,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-12-13 12:29:44,298 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 43 states have internal predecessors, (92), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2022-12-13 12:29:44,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:44,299 INFO L225 Difference]: With dead ends: 113 [2022-12-13 12:29:44,299 INFO L226 Difference]: Without dead ends: 113 [2022-12-13 12:29:44,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1033 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=563, Invalid=4851, Unknown=12, NotChecked=894, Total=6320 [2022-12-13 12:29:44,301 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 785 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 1894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 515 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:44,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1059 Invalid, 1894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1343 Invalid, 0 Unknown, 515 Unchecked, 0.7s Time] [2022-12-13 12:29:44,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-12-13 12:29:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 101. [2022-12-13 12:29:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.275) internal successors, (102), 94 states have internal predecessors, (102), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 12:29:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2022-12-13 12:29:44,303 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 54 [2022-12-13 12:29:44,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:44,303 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2022-12-13 12:29:44,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.8775510204081634) internal successors, (92), 43 states have internal predecessors, (92), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:29:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2022-12-13 12:29:44,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 12:29:44,303 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:44,304 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:44,308 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 12:29:44,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:44,505 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:44,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash 579814440, now seen corresponding path program 1 times [2022-12-13 12:29:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:44,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747707165] [2022-12-13 12:29:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:44,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:45,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:45,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:45,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:45,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:45,172 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:29:45,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:45,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747707165] [2022-12-13 12:29:45,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747707165] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:45,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420449525] [2022-12-13 12:29:45,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:45,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:45,173 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:45,174 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:45,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 12:29:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:45,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 78 conjunts are in the unsatisfiable core [2022-12-13 12:29:45,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:45,476 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:29:45,670 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-13 12:29:45,671 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 27 treesize of output 27 [2022-12-13 12:29:45,674 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 11 [2022-12-13 12:29:45,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:45,825 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2413 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2413))) (exists ((v_ArrVal_2414 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2414) |c_#memory_$Pointer$.offset|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2410 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_2410))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 12:29:45,867 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 12:29:45,868 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 21 treesize of output 29 [2022-12-13 12:29:45,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:45,880 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:29:45,880 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 47 [2022-12-13 12:29:45,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:45,885 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-13 12:29:45,959 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 19 [2022-12-13 12:29:46,199 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-12-13 12:29:46,200 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 41 treesize of output 48 [2022-12-13 12:29:46,203 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 21 treesize of output 13 [2022-12-13 12:29:46,275 INFO L321 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-12-13 12:29:46,275 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 42 treesize of output 34 [2022-12-13 12:29:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-12-13 12:29:46,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:48,374 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 12:29:48,583 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2415 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)) v_ArrVal_2415) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) 1)) is different from false [2022-12-13 12:29:48,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420449525] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:48,716 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:48,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 23] total 46 [2022-12-13 12:29:48,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997020676] [2022-12-13 12:29:48,717 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:48,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-12-13 12:29:48,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:48,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-12-13 12:29:48,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2226, Unknown=63, NotChecked=294, Total=2756 [2022-12-13 12:29:48,718 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 47 states, 44 states have (on average 2.022727272727273) internal successors, (89), 43 states have internal predecessors, (89), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:29:52,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:29:52,078 INFO L93 Difference]: Finished difference Result 152 states and 170 transitions. [2022-12-13 12:29:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-12-13 12:29:52,079 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 44 states have (on average 2.022727272727273) internal successors, (89), 43 states have internal predecessors, (89), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2022-12-13 12:29:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:29:52,079 INFO L225 Difference]: With dead ends: 152 [2022-12-13 12:29:52,079 INFO L226 Difference]: Without dead ends: 152 [2022-12-13 12:29:52,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1235 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=799, Invalid=5467, Unknown=66, NotChecked=474, Total=6806 [2022-12-13 12:29:52,080 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 1294 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 1372 mSolverCounterSat, 38 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1294 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1372 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 12:29:52,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1294 Valid, 899 Invalid, 1507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1372 Invalid, 3 Unknown, 94 Unchecked, 0.9s Time] [2022-12-13 12:29:52,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-13 12:29:52,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 100. [2022-12-13 12:29:52,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.2625) internal successors, (101), 93 states have internal predecessors, (101), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 12:29:52,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2022-12-13 12:29:52,082 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 55 [2022-12-13 12:29:52,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:29:52,083 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2022-12-13 12:29:52,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 44 states have (on average 2.022727272727273) internal successors, (89), 43 states have internal predecessors, (89), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:29:52,083 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2022-12-13 12:29:52,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-12-13 12:29:52,083 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:29:52,083 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:29:52,088 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 12:29:52,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:52,285 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:29:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:29:52,286 INFO L85 PathProgramCache]: Analyzing trace with hash 579814441, now seen corresponding path program 1 times [2022-12-13 12:29:52,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:29:52,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735180205] [2022-12-13 12:29:52,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:52,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:29:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:53,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:29:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:53,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:29:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:53,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:29:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 12:29:53,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:29:53,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735180205] [2022-12-13 12:29:53,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735180205] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:53,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790139979] [2022-12-13 12:29:53,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:29:53,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:29:53,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:29:53,211 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:29:53,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 12:29:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:29:53,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 108 conjunts are in the unsatisfiable core [2022-12-13 12:29:53,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:29:53,402 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:29:53,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:29:53,503 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:29:53,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:29:53,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:29:53,986 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:29:53,987 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 17 [2022-12-13 12:29:53,991 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 7 treesize of output 3 [2022-12-13 12:29:54,105 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_2599 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2599))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_2598 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2598))))) is different from true [2022-12-13 12:29:54,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:54,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 12:29:54,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:29:54,141 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:29:54,141 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 40 [2022-12-13 12:29:54,150 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:29:54,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 12:29:54,654 INFO L321 Elim1Store]: treesize reduction 40, result has 36.5 percent of original size [2022-12-13 12:29:54,654 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 120 treesize of output 105 [2022-12-13 12:29:54,670 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 12:29:54,670 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 75 [2022-12-13 12:29:54,689 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:29:54,693 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:29:54,694 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 23 [2022-12-13 12:29:54,785 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:29:54,785 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 31 [2022-12-13 12:29:54,790 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 26 treesize of output 14 [2022-12-13 12:29:54,871 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 12:29:54,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:29:54,981 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (and (forall ((v_ArrVal_2602 (Array Int Int)) (v_ArrVal_2601 Int)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_2601)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2602) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_2601 Int)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store .cse0 .cse1 v_ArrVal_2601)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2022-12-13 12:29:55,520 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:29:55,520 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 121 treesize of output 125 [2022-12-13 12:29:56,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790139979] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:29:56,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:29:56,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 31] total 56 [2022-12-13 12:29:56,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458801989] [2022-12-13 12:29:56,629 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:29:56,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-12-13 12:29:56,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:29:56,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-12-13 12:29:56,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=4166, Unknown=4, NotChecked=262, Total=4692 [2022-12-13 12:29:56,631 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand has 57 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 51 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:30:00,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:30:00,356 INFO L93 Difference]: Finished difference Result 210 states and 236 transitions. [2022-12-13 12:30:00,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-12-13 12:30:00,357 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 51 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2022-12-13 12:30:00,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:30:00,357 INFO L225 Difference]: With dead ends: 210 [2022-12-13 12:30:00,357 INFO L226 Difference]: Without dead ends: 210 [2022-12-13 12:30:00,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3252 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1084, Invalid=11127, Unknown=7, NotChecked=438, Total=12656 [2022-12-13 12:30:00,359 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1929 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1518 mSolverCounterSat, 39 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1929 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1518 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 12:30:00,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1929 Valid, 886 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1518 Invalid, 3 Unknown, 137 Unchecked, 0.9s Time] [2022-12-13 12:30:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-12-13 12:30:00,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 104. [2022-12-13 12:30:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.2470588235294118) internal successors, (106), 97 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 12:30:00,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 116 transitions. [2022-12-13 12:30:00,362 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 116 transitions. Word has length 55 [2022-12-13 12:30:00,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:30:00,362 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 116 transitions. [2022-12-13 12:30:00,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 51 states have internal predecessors, (96), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:30:00,362 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 116 transitions. [2022-12-13 12:30:00,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 12:30:00,363 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:30:00,363 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:30:00,368 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 12:30:00,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:30:00,564 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:30:00,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:30:00,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1106400888, now seen corresponding path program 1 times [2022-12-13 12:30:00,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:30:00,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774136374] [2022-12-13 12:30:00,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:00,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:30:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:01,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:30:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:02,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:30:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:30:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:30:02,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:30:02,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774136374] [2022-12-13 12:30:02,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774136374] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:02,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852562245] [2022-12-13 12:30:02,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:02,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:30:02,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:30:02,679 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:30:02,680 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 12:30:02,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:02,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 106 conjunts are in the unsatisfiable core [2022-12-13 12:30:02,826 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:30:03,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-13 12:30:03,402 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:30:03,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:30:03,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:30:04,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:04,007 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:30:04,007 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 20 [2022-12-13 12:30:04,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:30:04,239 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2781 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2781) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2782 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2782) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 12:30:04,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:04,272 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 80 treesize of output 74 [2022-12-13 12:30:04,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:04,287 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:30:04,287 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 67 [2022-12-13 12:30:04,305 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:30:04,305 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-12-13 12:30:05,004 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 12:30:05,004 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 100 treesize of output 85 [2022-12-13 12:30:05,014 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:30:05,014 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 94 treesize of output 89 [2022-12-13 12:30:05,130 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 81 treesize of output 57 [2022-12-13 12:30:05,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:05,340 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:30:05,340 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 20 [2022-12-13 12:30:05,343 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 12:30:05,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:30:05,522 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2783))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_2784) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2022-12-13 12:30:05,530 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2783))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_2784) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) 0))) is different from false [2022-12-13 12:30:05,535 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2783))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2784) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2022-12-13 12:30:05,546 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2783))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2784) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2022-12-13 12:30:05,552 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2784 (Array Int Int)) (v_ArrVal_2783 (Array Int Int))) (not (= (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2783))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2784) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) 0))) is different from false [2022-12-13 12:30:05,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852562245] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:05,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:30:05,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31] total 63 [2022-12-13 12:30:05,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681064130] [2022-12-13 12:30:05,809 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:30:05,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-12-13 12:30:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:30:05,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-13 12:30:05,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=4101, Unknown=7, NotChecked=798, Total=5112 [2022-12-13 12:30:05,811 INFO L87 Difference]: Start difference. First operand 104 states and 116 transitions. Second operand has 63 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 55 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:30:11,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:30:11,801 INFO L93 Difference]: Finished difference Result 205 states and 228 transitions. [2022-12-13 12:30:11,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 12:30:11,802 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 55 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2022-12-13 12:30:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:30:11,802 INFO L225 Difference]: With dead ends: 205 [2022-12-13 12:30:11,802 INFO L226 Difference]: Without dead ends: 205 [2022-12-13 12:30:11,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1433 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=760, Invalid=8959, Unknown=7, NotChecked=1194, Total=10920 [2022-12-13 12:30:11,803 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1312 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1312 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 2852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:30:11,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1312 Valid, 1803 Invalid, 2852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2678 Invalid, 0 Unknown, 148 Unchecked, 1.7s Time] [2022-12-13 12:30:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-12-13 12:30:11,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 111. [2022-12-13 12:30:11,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 92 states have (on average 1.2391304347826086) internal successors, (114), 104 states have internal predecessors, (114), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 12:30:11,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 124 transitions. [2022-12-13 12:30:11,806 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 124 transitions. Word has length 58 [2022-12-13 12:30:11,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:30:11,806 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 124 transitions. [2022-12-13 12:30:11,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 61 states have (on average 1.6229508196721312) internal successors, (99), 55 states have internal predecessors, (99), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:30:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 124 transitions. [2022-12-13 12:30:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-12-13 12:30:11,807 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:30:11,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:30:11,813 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-12-13 12:30:12,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:30:12,008 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:30:12,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:30:12,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1990872485, now seen corresponding path program 1 times [2022-12-13 12:30:12,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:30:12,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901570720] [2022-12-13 12:30:12,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:12,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:30:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:12,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:30:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:12,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:30:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:12,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:30:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:12,141 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 12:30:12,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:30:12,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901570720] [2022-12-13 12:30:12,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901570720] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:30:12,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 12:30:12,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 12:30:12,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646935783] [2022-12-13 12:30:12,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:30:12,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 12:30:12,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:30:12,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 12:30:12,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 12:30:12,143 INFO L87 Difference]: Start difference. First operand 111 states and 124 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:30:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:30:12,212 INFO L93 Difference]: Finished difference Result 113 states and 125 transitions. [2022-12-13 12:30:12,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 12:30:12,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2022-12-13 12:30:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:30:12,213 INFO L225 Difference]: With dead ends: 113 [2022-12-13 12:30:12,213 INFO L226 Difference]: Without dead ends: 113 [2022-12-13 12:30:12,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:30:12,213 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 7 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:30:12,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 257 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:30:12,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-12-13 12:30:12,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2022-12-13 12:30:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 91 states have (on average 1.2307692307692308) internal successors, (112), 103 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 12:30:12,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2022-12-13 12:30:12,215 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 61 [2022-12-13 12:30:12,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:30:12,215 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2022-12-13 12:30:12,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:30:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2022-12-13 12:30:12,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 12:30:12,216 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:30:12,216 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:30:12,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 12:30:12,216 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:30:12,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:30:12,216 INFO L85 PathProgramCache]: Analyzing trace with hash 2010860704, now seen corresponding path program 1 times [2022-12-13 12:30:12,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:30:12,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936345190] [2022-12-13 12:30:12,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:12,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:30:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:30:13,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:13,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:30:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:14,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:30:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:14,785 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:30:14,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:30:14,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936345190] [2022-12-13 12:30:14,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936345190] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:14,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1330634431] [2022-12-13 12:30:14,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:14,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:30:14,785 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:30:14,786 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:30:14,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 12:30:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:14,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 138 conjunts are in the unsatisfiable core [2022-12-13 12:30:14,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:30:14,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:30:15,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-12-13 12:30:15,174 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 12:30:15,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 12:30:15,452 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-12-13 12:30:15,510 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 11 treesize of output 7 [2022-12-13 12:30:15,634 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-12-13 12:30:15,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 12:30:15,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:15,810 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 21 treesize of output 20 [2022-12-13 12:30:15,816 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 13 treesize of output 9 [2022-12-13 12:30:16,253 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:30:16,253 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 32 [2022-12-13 12:30:16,257 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 7 treesize of output 3 [2022-12-13 12:30:16,456 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3074 (Array Int Int)) (v_ArrVal_3075 (Array Int Int)) (v_ArrVal_3076 (Array Int Int)) (|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3076)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_3074) |c_#memory_int|) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3075) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 12:30:16,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:16,498 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:30:16,498 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 63 [2022-12-13 12:30:16,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:16,511 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-12-13 12:30:16,520 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:30:16,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 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-12-13 12:30:16,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:16,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 12:30:17,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:30:17,388 INFO L321 Elim1Store]: treesize reduction 145, result has 11.0 percent of original size [2022-12-13 12:30:17,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 160 treesize of output 71 [2022-12-13 12:30:17,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-12-13 12:30:17,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-12-13 12:30:17,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:30:17,504 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 30 [2022-12-13 12:30:17,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:30:17,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:30:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 11 refuted. 9 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 12:30:17,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:30:21,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1330634431] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:21,141 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:30:21,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 67 [2022-12-13 12:30:21,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981805905] [2022-12-13 12:30:21,141 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:30:21,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-13 12:30:21,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:30:21,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-13 12:30:21,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=5121, Unknown=45, NotChecked=144, Total=5550 [2022-12-13 12:30:21,142 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 59 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:30:29,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:30:29,611 INFO L93 Difference]: Finished difference Result 171 states and 189 transitions. [2022-12-13 12:30:29,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 12:30:29,611 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 59 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-12-13 12:30:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:30:29,612 INFO L225 Difference]: With dead ends: 171 [2022-12-13 12:30:29,612 INFO L226 Difference]: Without dead ends: 171 [2022-12-13 12:30:29,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2482 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=1158, Invalid=10791, Unknown=45, NotChecked=216, Total=12210 [2022-12-13 12:30:29,613 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 1171 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 2628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:30:29,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1409 Invalid, 2628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2444 Invalid, 0 Unknown, 133 Unchecked, 1.6s Time] [2022-12-13 12:30:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-12-13 12:30:29,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 116. [2022-12-13 12:30:29,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 97 states have (on average 1.2164948453608246) internal successors, (118), 109 states have internal predecessors, (118), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 12:30:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 128 transitions. [2022-12-13 12:30:29,616 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 128 transitions. Word has length 63 [2022-12-13 12:30:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:30:29,616 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 128 transitions. [2022-12-13 12:30:29,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.6923076923076923) internal successors, (110), 59 states have internal predecessors, (110), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:30:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 128 transitions. [2022-12-13 12:30:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 12:30:29,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:30:29,617 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:30:29,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-12-13 12:30:29,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:30:29,818 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:30:29,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:30:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash 2010860700, now seen corresponding path program 1 times [2022-12-13 12:30:29,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:30:29,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199084244] [2022-12-13 12:30:29,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:29,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:30:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:30:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:30:31,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:31,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:30:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:31,829 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:30:31,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:30:31,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199084244] [2022-12-13 12:30:31,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199084244] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:31,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308092603] [2022-12-13 12:30:31,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:31,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:30:31,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:30:31,830 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:30:31,831 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 12:30:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:32,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 111 conjunts are in the unsatisfiable core [2022-12-13 12:30:32,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:30:32,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:30:32,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:30:32,141 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:30:32,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:30:32,390 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:30:32,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:30:32,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:30:32,753 INFO L321 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-12-13 12:30:32,753 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 50 treesize of output 32 [2022-12-13 12:30:32,757 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 23 treesize of output 15 [2022-12-13 12:30:32,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:30:32,968 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_3264 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3264) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3265 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3265))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 12:30:33,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:33,007 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:30:33,007 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 54 [2022-12-13 12:30:33,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:33,013 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 54 treesize of output 52 [2022-12-13 12:30:33,020 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:30:33,020 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-12-13 12:30:33,479 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 12:30:33,479 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 100 treesize of output 85 [2022-12-13 12:30:33,487 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 12:30:33,487 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 87 treesize of output 84 [2022-12-13 12:30:33,571 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 74 treesize of output 54 [2022-12-13 12:30:33,862 INFO L321 Elim1Store]: treesize reduction 3, result has 91.9 percent of original size [2022-12-13 12:30:33,862 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 53 [2022-12-13 12:30:34,050 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2022-12-13 12:30:34,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:30:34,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_24| Int) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_24|) (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 1) 0) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3267))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 4))) 1))) is different from false [2022-12-13 12:30:34,392 INFO L321 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-12-13 12:30:34,392 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 28 treesize of output 27 [2022-12-13 12:30:34,716 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_24| Int) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (or (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_24|) (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 1) 0) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3267))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 4)) .cse0)))) is different from false [2022-12-13 12:30:34,743 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_24| Int) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| 4)))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3267))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 4)) .cse1) (< (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_24|) (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 1) 0)))) is different from false [2022-12-13 12:30:34,754 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_24| Int) (v_ArrVal_3266 (Array Int Int)) (v_ArrVal_3267 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4)))) (or (<= (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 1) 0) (< (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_3266) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_24|) (= .cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_3267))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_24| 4)))))) is different from false [2022-12-13 12:30:35,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308092603] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:35,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:30:35,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 34] total 67 [2022-12-13 12:30:35,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281736363] [2022-12-13 12:30:35,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:30:35,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-12-13 12:30:35,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:30:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-12-13 12:30:35,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=4862, Unknown=46, NotChecked=720, Total=5852 [2022-12-13 12:30:35,018 INFO L87 Difference]: Start difference. First operand 116 states and 128 transitions. Second operand has 68 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 62 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:30:40,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:30:40,017 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2022-12-13 12:30:40,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 12:30:40,018 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 62 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-12-13 12:30:40,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:30:40,018 INFO L225 Difference]: With dead ends: 196 [2022-12-13 12:30:40,018 INFO L226 Difference]: Without dead ends: 196 [2022-12-13 12:30:40,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2794 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=851, Invalid=10253, Unknown=46, NotChecked=1060, Total=12210 [2022-12-13 12:30:40,019 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1189 mSDsluCounter, 1423 mSDsCounter, 0 mSdLazyCounter, 2625 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-12-13 12:30:40,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 1461 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2625 Invalid, 0 Unknown, 112 Unchecked, 1.6s Time] [2022-12-13 12:30:40,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-12-13 12:30:40,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 117. [2022-12-13 12:30:40,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 98 states have (on average 1.2244897959183674) internal successors, (120), 110 states have internal predecessors, (120), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 12:30:40,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 130 transitions. [2022-12-13 12:30:40,022 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 130 transitions. Word has length 63 [2022-12-13 12:30:40,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:30:40,022 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 130 transitions. [2022-12-13 12:30:40,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.7076923076923076) internal successors, (111), 62 states have internal predecessors, (111), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:30:40,022 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 130 transitions. [2022-12-13 12:30:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 12:30:40,022 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:30:40,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:30:40,027 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-12-13 12:30:40,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 12:30:40,224 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:30:40,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:30:40,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2010860701, now seen corresponding path program 1 times [2022-12-13 12:30:40,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:30:40,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664452554] [2022-12-13 12:30:40,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:40,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:30:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:30:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:41,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:30:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:42,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:30:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:42,509 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:30:42,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:30:42,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664452554] [2022-12-13 12:30:42,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664452554] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:42,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223348956] [2022-12-13 12:30:42,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:42,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:30:42,510 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:30:42,510 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:30:42,511 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 12:30:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:42,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 134 conjunts are in the unsatisfiable core [2022-12-13 12:30:42,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:30:43,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:30:43,143 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:30:43,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:30:43,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:30:43,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:30:43,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:30:43,783 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2022-12-13 12:30:43,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:30:43,792 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:30:43,792 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:30:44,034 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_3448 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3448))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_3449 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3449) |c_#memory_$Pointer$.base|)))) is different from true [2022-12-13 12:30:44,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:44,072 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:30:44,073 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 52 [2022-12-13 12:30:44,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:44,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:44,083 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:30:44,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 25 treesize of output 30 [2022-12-13 12:30:44,094 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:30:44,094 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-12-13 12:30:44,752 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 12:30:44,752 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 116 treesize of output 97 [2022-12-13 12:30:44,768 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-12-13 12:30:44,768 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 74 treesize of output 70 [2022-12-13 12:30:45,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:30:45,222 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:30:45,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:45,228 INFO L321 Elim1Store]: treesize reduction 3, result has 70.0 percent of original size [2022-12-13 12:30:45,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 102 treesize of output 55 [2022-12-13 12:30:45,241 INFO L321 Elim1Store]: treesize reduction 46, result has 13.2 percent of original size [2022-12-13 12:30:45,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 31 [2022-12-13 12:30:45,365 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 12:30:45,365 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:30:45,874 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3450 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3450))) (let ((.cse4 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3451 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3451))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ .cse4 4))) (<= (+ (select (select .cse0 .cse1) .cse2) 8) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse4)))))) (forall ((v_ArrVal_3450 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3450))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_3451 (Array Int Int))) (<= 0 (+ (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse6 4)) 4))) (not (<= 0 .cse6))))))) is different from false [2022-12-13 12:30:45,898 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:30:45,898 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 115 treesize of output 119 [2022-12-13 12:30:45,955 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (= (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_33))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse0 4)) |c_ULTIMATE.start_sll_append_~last~0#1.base|)))) (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3450))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse2 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse3 4)) 4)) (not (<= 0 .cse3)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_32))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (< (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse4 4)) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 1))))))) is different from false [2022-12-13 12:30:45,978 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_3450))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse1 4)) 4)) (not (<= 0 .cse1)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_32))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse2)) (< (select (select .cse3 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse2)) (+ |c_ULTIMATE.start_sll_append_#t~mem10#1.offset| 1)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_33))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse5)) |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (not (<= 0 .cse5)))))) is different from false [2022-12-13 12:30:46,001 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3))) (and (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_32))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (< (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse2 4)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse3) 1)) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_3450))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse4)) (<= 0 (+ (select (select .cse5 (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse4 4)) 4)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse1 (select (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 v_prenex_33))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ .cse7 4))) (not (<= 0 .cse7)))))))) is different from false [2022-12-13 12:30:46,059 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) .cse5))) (and (forall ((v_ArrVal_3450 (Array Int Int)) (v_ArrVal_3451 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_3450))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (<= 0 (+ (select (select .cse1 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_3451) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse0 4)) 4)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse2 v_prenex_32))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse3)) (< (select (select .cse4 (select (select (store |c_#memory_$Pointer$.base| .cse2 v_prenex_33) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 .cse3)) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) .cse5) 1)))))) (forall ((v_prenex_32 (Array Int Int)) (v_prenex_33 (Array Int Int))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_prenex_32) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse2 (select (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_33))) (select .cse6 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 .cse7))) (not (<= 0 .cse7)))))))) is different from false [2022-12-13 12:30:46,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223348956] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:46,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:30:46,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 34] total 68 [2022-12-13 12:30:46,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837127166] [2022-12-13 12:30:46,929 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:30:46,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-13 12:30:46,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:30:46,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-13 12:30:46,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=5613, Unknown=35, NotChecked=930, Total=6806 [2022-12-13 12:30:46,931 INFO L87 Difference]: Start difference. First operand 117 states and 130 transitions. Second operand has 69 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 62 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:30:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:30:54,384 INFO L93 Difference]: Finished difference Result 212 states and 233 transitions. [2022-12-13 12:30:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 12:30:54,385 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 62 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-12-13 12:30:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:30:54,386 INFO L225 Difference]: With dead ends: 212 [2022-12-13 12:30:54,386 INFO L226 Difference]: Without dead ends: 212 [2022-12-13 12:30:54,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2288 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1181, Invalid=11918, Unknown=35, NotChecked=1386, Total=14520 [2022-12-13 12:30:54,387 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 2145 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 2801 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2145 SdHoareTripleChecker+Valid, 1448 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 178 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 12:30:54,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2145 Valid, 1448 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2801 Invalid, 0 Unknown, 178 Unchecked, 1.9s Time] [2022-12-13 12:30:54,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-12-13 12:30:54,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 119. [2022-12-13 12:30:54,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.22) internal successors, (122), 112 states have internal predecessors, (122), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-12-13 12:30:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 132 transitions. [2022-12-13 12:30:54,390 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 132 transitions. Word has length 63 [2022-12-13 12:30:54,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:30:54,390 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 132 transitions. [2022-12-13 12:30:54,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 66 states have (on average 1.6818181818181819) internal successors, (111), 62 states have internal predecessors, (111), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:30:54,391 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2022-12-13 12:30:54,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-13 12:30:54,391 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:30:54,391 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:30:54,396 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-12-13 12:30:54,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-12-13 12:30:54,593 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:30:54,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:30:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1590487563, now seen corresponding path program 3 times [2022-12-13 12:30:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:30:54,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049763426] [2022-12-13 12:30:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:30:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:54,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:30:54,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:30:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:54,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-12-13 12:30:54,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:54,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-12-13 12:30:54,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-12-13 12:30:54,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:30:54,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049763426] [2022-12-13 12:30:54,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049763426] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:54,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957879861] [2022-12-13 12:30:54,722 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 12:30:54,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:30:54,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:30:54,723 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:30:54,724 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 12:30:55,172 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-13 12:30:55,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:30:55,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 12:30:55,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:30:55,192 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-12-13 12:30:55,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:30:55,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957879861] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:30:55,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:30:55,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-12-13 12:30:55,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624053347] [2022-12-13 12:30:55,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:30:55,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 12:30:55,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:30:55,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 12:30:55,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:30:55,194 INFO L87 Difference]: Start difference. First operand 119 states and 132 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 12:30:55,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:30:55,203 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-12-13 12:30:55,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 12:30:55,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 66 [2022-12-13 12:30:55,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:30:55,204 INFO L225 Difference]: With dead ends: 85 [2022-12-13 12:30:55,204 INFO L226 Difference]: Without dead ends: 85 [2022-12-13 12:30:55,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 12:30:55,205 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 106 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 12:30:55,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 91 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 12:30:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-12-13 12:30:55,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-12-13 12:30:55,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:30:55,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-12-13 12:30:55,206 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 66 [2022-12-13 12:30:55,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:30:55,206 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-12-13 12:30:55,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 12:30:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-12-13 12:30:55,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-12-13 12:30:55,207 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:30:55,207 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:30:55,213 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-12-13 12:30:55,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 12:30:55,409 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:30:55,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:30:55,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1241889524, now seen corresponding path program 1 times [2022-12-13 12:30:55,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:30:55,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175837384] [2022-12-13 12:30:55,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:55,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:30:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:30:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:57,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:30:57,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:57,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:30:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:57,719 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:30:57,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:30:57,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175837384] [2022-12-13 12:30:57,720 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175837384] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:30:57,720 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138630736] [2022-12-13 12:30:57,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:30:57,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:30:57,720 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:30:57,721 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:30:57,722 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 12:30:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:30:57,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 133 conjunts are in the unsatisfiable core [2022-12-13 12:30:57,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:30:58,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:30:58,374 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:30:58,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:30:58,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:30:58,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:58,822 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:30:58,823 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 16 [2022-12-13 12:30:58,825 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:30:59,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:59,226 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 62 treesize of output 58 [2022-12-13 12:30:59,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:30:59,239 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:30:59,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-12-13 12:30:59,249 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:30:59,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 12:31:00,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:00,096 INFO L321 Elim1Store]: treesize reduction 66, result has 24.1 percent of original size [2022-12-13 12:31:00,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 125 treesize of output 68 [2022-12-13 12:31:00,114 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-12-13 12:31:00,115 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 195 treesize of output 171 [2022-12-13 12:31:00,687 INFO L321 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-12-13 12:31:00,688 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 209 treesize of output 126 [2022-12-13 12:31:01,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:01,142 INFO L321 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-12-13 12:31:01,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 106 treesize of output 32 [2022-12-13 12:31:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 12 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:31:01,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:31:02,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138630736] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:31:02,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:31:02,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 35] total 72 [2022-12-13 12:31:02,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704879921] [2022-12-13 12:31:02,870 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:31:02,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-12-13 12:31:02,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:31:02,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-12-13 12:31:02,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=6864, Unknown=41, NotChecked=0, Total=7140 [2022-12-13 12:31:02,872 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 72 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 63 states have internal predecessors, (117), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:31:12,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:31:12,195 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-12-13 12:31:12,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-12-13 12:31:12,195 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 63 states have internal predecessors, (117), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 67 [2022-12-13 12:31:12,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:31:12,196 INFO L225 Difference]: With dead ends: 99 [2022-12-13 12:31:12,196 INFO L226 Difference]: Without dead ends: 99 [2022-12-13 12:31:12,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 55 SyntacticMatches, 2 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2128 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=869, Invalid=13370, Unknown=41, NotChecked=0, Total=14280 [2022-12-13 12:31:12,196 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 873 mSDsluCounter, 1491 mSDsCounter, 0 mSdLazyCounter, 2797 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-12-13 12:31:12,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 1525 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2797 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-12-13 12:31:12,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-12-13 12:31:12,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 84. [2022-12-13 12:31:12,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 79 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:31:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-12-13 12:31:12,198 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 67 [2022-12-13 12:31:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:31:12,198 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-12-13 12:31:12,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 70 states have (on average 1.6714285714285715) internal successors, (117), 63 states have internal predecessors, (117), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:31:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-12-13 12:31:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 12:31:12,199 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:31:12,199 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:31:12,204 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-12-13 12:31:12,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 12:31:12,399 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:31:12,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:31:12,400 INFO L85 PathProgramCache]: Analyzing trace with hash -502226385, now seen corresponding path program 1 times [2022-12-13 12:31:12,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:31:12,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722710088] [2022-12-13 12:31:12,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:31:12,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:31:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:31:14,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:31:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:31:14,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:31:14,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:31:14,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:31:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:31:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:31:15,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:31:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722710088] [2022-12-13 12:31:15,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722710088] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:31:15,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743784673] [2022-12-13 12:31:15,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:31:15,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:31:15,459 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:31:15,459 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:31:15,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-12-13 12:31:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:31:15,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 165 conjunts are in the unsatisfiable core [2022-12-13 12:31:15,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:31:15,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 12:31:16,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 12:31:16,287 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 7 treesize of output 3 [2022-12-13 12:31:16,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:31:16,685 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 12:31:16,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 12:31:16,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:31:16,709 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-12-13 12:31:16,709 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 19 treesize of output 16 [2022-12-13 12:31:16,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:31:16,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 12:31:16,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:31:17,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:17,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:31:17,589 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 139 treesize of output 66 [2022-12-13 12:31:17,596 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:31:17,596 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-12-13 12:31:17,601 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 7 treesize of output 3 [2022-12-13 12:31:17,604 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-12-13 12:31:17,875 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_4032 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_4032))) (exists ((v_ArrVal_4033 (Array Int Int))) (= (store |c_old(#memory_int)| |node_create_~temp~0#1.base| v_ArrVal_4033) |c_#memory_int|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_4034 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_4034))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 12:31:17,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:17,919 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:31:17,920 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 145 treesize of output 125 [2022-12-13 12:31:17,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:17,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:17,941 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-13 12:31:17,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 150 treesize of output 127 [2022-12-13 12:31:17,957 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:17,957 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 42 treesize of output 44 [2022-12-13 12:31:17,974 INFO L321 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-12-13 12:31:17,974 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 34 treesize of output 36 [2022-12-13 12:31:18,814 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 12:31:18,814 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 206 treesize of output 171 [2022-12-13 12:31:18,832 INFO L321 Elim1Store]: treesize reduction 52, result has 22.4 percent of original size [2022-12-13 12:31:18,832 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 200 treesize of output 168 [2022-12-13 12:31:18,839 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 91 treesize of output 76 [2022-12-13 12:31:19,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:19,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:31:19,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 137 treesize of output 94 [2022-12-13 12:31:19,375 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-12-13 12:31:19,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 86 treesize of output 63 [2022-12-13 12:31:19,934 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:31:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 12:31:20,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:31:20,699 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4035 (Array Int Int)) (v_ArrVal_4036 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_4038 Int)) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_4035))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_4036))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4) v_ArrVal_4038)) (select (select .cse0 .cse1) .cse2)) (select (select .cse3 .cse1) .cse2))))) (< (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))) is different from false [2022-12-13 12:31:20,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4035 (Array Int Int)) (v_ArrVal_4036 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_4038 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_4035))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_4036))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_#t~mem10#1.base|) (+ 4 |c_ULTIMATE.start_sll_append_#t~mem10#1.offset|) v_ArrVal_4038)) (select (select .cse1 .cse2) .cse3)) (select (select .cse0 .cse2) .cse3))))) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|))))) is different from false [2022-12-13 12:31:20,747 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4035 (Array Int Int)) (v_ArrVal_4036 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_4038 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4035))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4036))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (select (select (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2) 4) v_ArrVal_4038)) (select (select .cse3 .cse4) .cse5)) (select (select .cse0 .cse4) .cse5)))))))))) is different from false [2022-12-13 12:31:20,770 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4035 (Array Int Int)) (|v_ULTIMATE.start_main_~ptr~0#1.offset_30| Int) (v_ArrVal_4036 (Array Int Int)) (v_ArrVal_4038 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_4035))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_main_~ptr~0#1.offset_30|) (not (<= 0 |v_ULTIMATE.start_main_~ptr~0#1.offset_30|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_4036))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ |v_ULTIMATE.start_main_~ptr~0#1.offset_30| 4))) (select (select (store |c_#memory_int| .cse1 (store (select |c_#memory_int| .cse1) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base|) .cse2) 4) v_ArrVal_4038)) (select (select .cse3 .cse4) .cse5)) (select (select .cse0 .cse4) .cse5)))))))))) is different from false [2022-12-13 12:31:22,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743784673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:31:22,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:31:22,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 37] total 74 [2022-12-13 12:31:22,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739553942] [2022-12-13 12:31:22,628 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:31:22,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-12-13 12:31:22,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:31:22,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-12-13 12:31:22,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=6193, Unknown=42, NotChecked=810, Total=7310 [2022-12-13 12:31:22,630 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 66 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:31:34,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:31:34,396 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2022-12-13 12:31:34,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-12-13 12:31:34,396 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 66 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 69 [2022-12-13 12:31:34,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:31:34,397 INFO L225 Difference]: With dead ends: 97 [2022-12-13 12:31:34,397 INFO L226 Difference]: Without dead ends: 97 [2022-12-13 12:31:34,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 116 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2082 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=1016, Invalid=11618, Unknown=42, NotChecked=1130, Total=13806 [2022-12-13 12:31:34,398 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 961 mSDsluCounter, 1239 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 962 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 2705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-12-13 12:31:34,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [962 Valid, 1272 Invalid, 2705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2578 Invalid, 0 Unknown, 91 Unchecked, 2.3s Time] [2022-12-13 12:31:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-12-13 12:31:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 85. [2022-12-13 12:31:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 70 states have (on average 1.2) internal successors, (84), 80 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:31:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2022-12-13 12:31:34,400 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 69 [2022-12-13 12:31:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:31:34,400 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2022-12-13 12:31:34,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.6944444444444444) internal successors, (122), 66 states have internal predecessors, (122), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:31:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2022-12-13 12:31:34,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 12:31:34,400 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:31:34,400 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:31:34,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-12-13 12:31:34,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 12:31:34,601 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:31:34,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:31:34,602 INFO L85 PathProgramCache]: Analyzing trace with hash -502226389, now seen corresponding path program 2 times [2022-12-13 12:31:34,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:31:34,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361955813] [2022-12-13 12:31:34,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:31:34,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:31:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:31:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:31:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:31:36,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:31:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:31:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:31:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:31:37,139 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:31:37,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:31:37,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361955813] [2022-12-13 12:31:37,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361955813] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:31:37,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081496871] [2022-12-13 12:31:37,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:31:37,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:31:37,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:31:37,140 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:31:37,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-12-13 12:31:37,366 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:31:37,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:31:37,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 136 conjunts are in the unsatisfiable core [2022-12-13 12:31:37,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:31:37,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:31:37,886 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-12-13 12:31:37,889 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 7 treesize of output 3 [2022-12-13 12:31:38,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:38,302 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 33 treesize of output 31 [2022-12-13 12:31:38,322 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-12-13 12:31:38,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 21 treesize of output 29 [2022-12-13 12:31:38,331 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-13 12:31:38,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:38,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 12:31:39,111 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:31:39,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 12:31:39,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:31:39,426 INFO L321 Elim1Store]: treesize reduction 96, result has 17.9 percent of original size [2022-12-13 12:31:39,426 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 213 treesize of output 106 [2022-12-13 12:31:39,449 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-13 12:31:39,449 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 223 treesize of output 140 [2022-12-13 12:31:40,302 INFO L321 Elim1Store]: treesize reduction 52, result has 38.8 percent of original size [2022-12-13 12:31:40,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 284 treesize of output 238 [2022-12-13 12:31:41,396 INFO L321 Elim1Store]: treesize reduction 60, result has 69.5 percent of original size [2022-12-13 12:31:41,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 11 new quantified variables, introduced 21 case distinctions, treesize of input 208 treesize of output 214 [2022-12-13 12:31:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:31:47,221 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:31:52,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081496871] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:31:52,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:31:52,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 31] total 72 [2022-12-13 12:31:52,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561361952] [2022-12-13 12:31:52,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:31:52,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-12-13 12:31:52,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:31:52,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-12-13 12:31:52,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=7759, Unknown=2, NotChecked=0, Total=8010 [2022-12-13 12:31:52,868 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 73 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 66 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:32:05,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:32:05,703 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-12-13 12:32:05,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-13 12:32:05,703 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 66 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 69 [2022-12-13 12:32:05,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:32:05,703 INFO L225 Difference]: With dead ends: 122 [2022-12-13 12:32:05,704 INFO L226 Difference]: Without dead ends: 122 [2022-12-13 12:32:05,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1807 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=1215, Invalid=14531, Unknown=4, NotChecked=0, Total=15750 [2022-12-13 12:32:05,705 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1526 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 3369 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3369 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:32:05,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1526 Valid, 1357 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3369 Invalid, 2 Unknown, 0 Unchecked, 2.8s Time] [2022-12-13 12:32:05,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-12-13 12:32:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 86. [2022-12-13 12:32:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 81 states have internal predecessors, (86), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:32:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-12-13 12:32:05,706 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 69 [2022-12-13 12:32:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:32:05,706 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-12-13 12:32:05,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.7714285714285714) internal successors, (124), 66 states have internal predecessors, (124), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 12:32:05,707 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-12-13 12:32:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-12-13 12:32:05,707 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:32:05,707 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:32:05,712 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-12-13 12:32:05,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:32:05,907 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:32:05,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:32:05,908 INFO L85 PathProgramCache]: Analyzing trace with hash -502226388, now seen corresponding path program 2 times [2022-12-13 12:32:05,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:32:05,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759082808] [2022-12-13 12:32:05,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:32:05,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:32:05,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:32:08,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:32:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:32:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:32:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:32:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:32:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:32:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 2 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:32:09,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:32:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759082808] [2022-12-13 12:32:09,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759082808] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:32:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803543147] [2022-12-13 12:32:09,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:32:09,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:32:09,043 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:32:09,044 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:32:09,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-12-13 12:32:09,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:32:09,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:32:09,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 198 conjunts are in the unsatisfiable core [2022-12-13 12:32:09,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:32:09,337 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 12:32:09,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 12:32:09,416 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:32:09,416 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 19 [2022-12-13 12:32:09,610 INFO L321 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-12-13 12:32:09,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 26 [2022-12-13 12:32:10,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:32:10,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:32:10,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:10,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 12:32:10,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:10,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 12:32:10,231 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:32:10,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:32:10,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:32:10,487 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-13 12:32:10,495 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:32:10,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-12-13 12:32:11,014 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:32:11,015 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 35 [2022-12-13 12:32:11,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-12-13 12:32:11,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:11,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:32:11,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:11,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:11,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:11,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-12-13 12:32:11,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:11,571 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:32:11,572 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 70 [2022-12-13 12:32:11,587 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:32:11,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 12:32:13,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:13,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:32:13,222 INFO L321 Elim1Store]: treesize reduction 139, result has 14.7 percent of original size [2022-12-13 12:32:13,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 208 treesize of output 106 [2022-12-13 12:32:13,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:13,251 INFO L321 Elim1Store]: treesize reduction 104, result has 22.4 percent of original size [2022-12-13 12:32:13,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 230 treesize of output 160 [2022-12-13 12:32:14,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:14,800 INFO L321 Elim1Store]: treesize reduction 63, result has 11.3 percent of original size [2022-12-13 12:32:14,800 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 285 treesize of output 111 [2022-12-13 12:32:14,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:32:14,817 INFO L321 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-12-13 12:32:14,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 32 [2022-12-13 12:32:15,121 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 12:32:15,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:32:19,011 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:32:19,011 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 1907 treesize of output 1911 [2022-12-13 12:32:33,770 WARN L233 SmtUtils]: Spent 8.29s on a formula simplification that was a NOOP. DAG size: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 12:32:33,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803543147] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:32:33,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:32:33,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 41] total 84 [2022-12-13 12:32:33,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748813886] [2022-12-13 12:32:33,773 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:32:33,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-12-13 12:32:33,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:32:33,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-12-13 12:32:33,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=10806, Unknown=0, NotChecked=0, Total=11130 [2022-12-13 12:32:33,775 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 85 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 76 states have internal predecessors, (126), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:33:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:33:02,785 INFO L93 Difference]: Finished difference Result 138 states and 147 transitions. [2022-12-13 12:33:02,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-12-13 12:33:02,785 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 76 states have internal predecessors, (126), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 69 [2022-12-13 12:33:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:33:02,786 INFO L225 Difference]: With dead ends: 138 [2022-12-13 12:33:02,786 INFO L226 Difference]: Without dead ends: 138 [2022-12-13 12:33:02,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3290 ImplicationChecksByTransitivity, 48.2s TimeCoverageRelationStatistics Valid=1677, Invalid=19785, Unknown=0, NotChecked=0, Total=21462 [2022-12-13 12:33:02,788 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 2302 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2302 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 3349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-12-13 12:33:02,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2302 Valid, 1306 Invalid, 3349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 3282 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-12-13 12:33:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-13 12:33:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 91. [2022-12-13 12:33:02,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.1973684210526316) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:33:02,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-12-13 12:33:02,790 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 69 [2022-12-13 12:33:02,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:33:02,790 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-12-13 12:33:02,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 82 states have (on average 1.5365853658536586) internal successors, (126), 76 states have internal predecessors, (126), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:33:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-12-13 12:33:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-13 12:33:02,791 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:33:02,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:02,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-12-13 12:33:02,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:33:02,992 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:33:02,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:02,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1197977859, now seen corresponding path program 2 times [2022-12-13 12:33:02,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:02,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474677853] [2022-12-13 12:33:02,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:02,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:03,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:07,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:33:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:07,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:33:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:33:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:08,819 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 34 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:33:08,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:08,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474677853] [2022-12-13 12:33:08,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474677853] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:33:08,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158267077] [2022-12-13 12:33:08,819 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:33:08,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:33:08,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:33:08,820 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:33:08,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-12-13 12:33:09,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:33:09,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:33:09,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 193 conjunts are in the unsatisfiable core [2022-12-13 12:33:09,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:09,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:33:09,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:33:09,482 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 12:33:09,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 12:33:09,863 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-12-13 12:33:09,919 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-12-13 12:33:09,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-12-13 12:33:10,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:33:10,229 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:33:10,951 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:33:10,951 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 33 [2022-12-13 12:33:10,956 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 16 treesize of output 10 [2022-12-13 12:33:10,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:33:11,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 12:33:11,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:11,772 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:33:11,773 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 64 [2022-12-13 12:33:11,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:11,798 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 12:33:11,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2022-12-13 12:33:11,814 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:11,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 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-12-13 12:33:13,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:13,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:33:13,360 INFO L321 Elim1Store]: treesize reduction 103, result has 14.9 percent of original size [2022-12-13 12:33:13,361 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 198 treesize of output 102 [2022-12-13 12:33:13,372 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 12:33:13,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 206 treesize of output 149 [2022-12-13 12:33:13,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2022-12-13 12:33:15,798 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:33:15,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:15,826 INFO L321 Elim1Store]: treesize reduction 91, result has 10.8 percent of original size [2022-12-13 12:33:15,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 270 treesize of output 114 [2022-12-13 12:33:15,850 INFO L321 Elim1Store]: treesize reduction 12, result has 36.8 percent of original size [2022-12-13 12:33:15,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 32 [2022-12-13 12:33:16,433 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:33:16,436 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-13 12:33:16,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:33:19,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:33:19,743 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 1299 treesize of output 1300 [2022-12-13 12:33:19,774 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:33:19,774 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 3221 treesize of output 3224 [2022-12-13 12:33:19,783 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 1290 treesize of output 659 [2022-12-13 12:33:19,936 WARN L837 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_append_~data#1|) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| Int) (v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4628)) (.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4629))) (let ((.cse6 (select (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse7 (+ (select (select .cse5 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse3 (select (select .cse2 .cse6) .cse7)) (.cse4 (+ (select (select .cse5 .cse6) .cse7) 4))) (let ((.cse1 (store .cse5 .cse3 (store (select .cse5 .cse3) .cse4 0)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (not (<= 0 .cse0)) (<= (+ (select (select .cse1 (select (select (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ .cse0 4)) 1) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|) 0)))))))))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4628)) (.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4629))) (let ((.cse18 (select (select .cse15 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse19 (+ (select (select .cse17 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse8 (select (select .cse15 .cse18) .cse19)) (.cse16 (+ (select (select .cse17 .cse18) .cse19) 4))) (let ((.cse14 (store .cse17 .cse8 (store (select .cse17 .cse8) .cse16 0)))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (store .cse15 .cse8 (store (select .cse15 .cse8) .cse16 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (+ .cse13 4))) (let ((.cse12 (select (select .cse14 .cse10) .cse11))) (or (not (= .cse8 (select (select .cse9 (select (select .cse9 .cse10) .cse11)) (+ .cse12 4)))) (not (<= 0 .cse13)) (<= (+ .cse12 1) 0)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (let ((.cse29 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4628)) (.cse26 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4629))) (let ((.cse30 (select (select .cse26 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse31 (+ (select (select .cse29 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse27 (select (select .cse26 .cse30) .cse31)) (.cse28 (+ (select (select .cse29 .cse30) .cse31) 4))) (let ((.cse25 (store .cse29 .cse27 (store (select .cse29 .cse27) .cse28 0)))) (let ((.cse20 (select (select .cse25 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (store .cse26 .cse27 (store (select .cse26 .cse27) .cse28 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)))) (let ((.cse23 (select (select .cse22 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse24 (+ .cse20 4))) (let ((.cse21 (select (select .cse25 .cse23) .cse24))) (or (not (<= 0 .cse20)) (<= (+ .cse21 1) 0) (= (select (select .cse22 (select (select .cse22 .cse23) .cse24)) (+ .cse21 4)) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|) 0)))) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| Int)) (or (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_4628 (Array Int Int)) (v_ArrVal_4629 (Array Int Int))) (let ((.cse41 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4628)) (.cse38 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53| v_ArrVal_4629))) (let ((.cse42 (select (select .cse38 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse43 (+ (select (select .cse41 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse39 (select (select .cse38 .cse42) .cse43)) (.cse40 (+ (select (select .cse41 .cse42) .cse43) 4))) (let ((.cse34 (store .cse41 .cse39 (store (select .cse41 .cse39) .cse40 0)))) (let ((.cse32 (select (select .cse34 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (store .cse38 .cse39 (store (select .cse38 .cse39) .cse40 |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|)))) (let ((.cse36 (select (select .cse35 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (+ .cse32 4))) (let ((.cse33 (select (select .cse34 .cse36) .cse37))) (or (not (<= 0 .cse32)) (<= (+ .cse33 1) 0) (= (select (select .cse34 (select (select .cse35 .cse36) .cse37)) (+ .cse33 4)) 0)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_53|) 0))))) is different from false [2022-12-13 12:33:19,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158267077] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:33:19,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:33:19,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 38] total 82 [2022-12-13 12:33:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420593877] [2022-12-13 12:33:19,946 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:33:19,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-12-13 12:33:19,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:19,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-12-13 12:33:19,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=8470, Unknown=3, NotChecked=184, Total=8930 [2022-12-13 12:33:19,947 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 82 states, 80 states have (on average 1.5625) internal successors, (125), 73 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:33:38,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:33:38,564 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-12-13 12:33:38,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-13 12:33:38,564 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 80 states have (on average 1.5625) internal successors, (125), 73 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 73 [2022-12-13 12:33:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:33:38,564 INFO L225 Difference]: With dead ends: 138 [2022-12-13 12:33:38,565 INFO L226 Difference]: Without dead ends: 138 [2022-12-13 12:33:38,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3140 ImplicationChecksByTransitivity, 26.7s TimeCoverageRelationStatistics Valid=946, Invalid=16347, Unknown=3, NotChecked=260, Total=17556 [2022-12-13 12:33:38,566 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1102 mSDsluCounter, 1420 mSDsCounter, 0 mSdLazyCounter, 3432 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1453 SdHoareTripleChecker+Invalid, 3458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 3432 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:33:38,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1102 Valid, 1453 Invalid, 3458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 3432 Invalid, 1 Unknown, 0 Unchecked, 3.4s Time] [2022-12-13 12:33:38,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-13 12:33:38,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 92. [2022-12-13 12:33:38,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 77 states have (on average 1.1948051948051948) internal successors, (92), 87 states have internal predecessors, (92), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:33:38,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-12-13 12:33:38,568 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 73 [2022-12-13 12:33:38,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:33:38,568 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-12-13 12:33:38,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 80 states have (on average 1.5625) internal successors, (125), 73 states have internal predecessors, (125), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:33:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-12-13 12:33:38,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-12-13 12:33:38,568 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:33:38,569 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:38,574 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-12-13 12:33:38,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:33:38,770 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:33:38,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:38,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1517390927, now seen corresponding path program 1 times [2022-12-13 12:33:38,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:38,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309547527] [2022-12-13 12:33:38,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:38,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:38,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:33:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:38,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:33:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:38,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:33:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:38,971 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 12:33:38,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:38,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309547527] [2022-12-13 12:33:38,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309547527] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:33:38,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888295296] [2022-12-13 12:33:38,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:38,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:33:38,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:33:38,972 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:33:38,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-12-13 12:33:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:39,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 12:33:39,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 12:33:39,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:33:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 12:33:39,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888295296] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 12:33:39,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 12:33:39,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-12-13 12:33:39,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549008565] [2022-12-13 12:33:39,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 12:33:39,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 12:33:39,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:33:39,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 12:33:39,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:33:39,592 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 12:33:39,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:33:39,745 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2022-12-13 12:33:39,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:33:39,745 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 74 [2022-12-13 12:33:39,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:33:39,746 INFO L225 Difference]: With dead ends: 110 [2022-12-13 12:33:39,746 INFO L226 Difference]: Without dead ends: 110 [2022-12-13 12:33:39,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 146 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 12:33:39,747 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 126 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:33:39,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 603 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:33:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-12-13 12:33:39,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 93. [2022-12-13 12:33:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 88 states have internal predecessors, (93), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:33:39,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2022-12-13 12:33:39,748 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 74 [2022-12-13 12:33:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:33:39,749 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2022-12-13 12:33:39,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.0) internal successors, (78), 12 states have internal predecessors, (78), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 12:33:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2022-12-13 12:33:39,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-13 12:33:39,749 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:33:39,749 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:33:39,754 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-12-13 12:33:39,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-12-13 12:33:39,950 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:33:39,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:33:39,952 INFO L85 PathProgramCache]: Analyzing trace with hash 248336510, now seen corresponding path program 2 times [2022-12-13 12:33:39,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:33:39,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805134360] [2022-12-13 12:33:39,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:33:39,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:33:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:43,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:33:43,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:43,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:33:43,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:43,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:33:43,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:33:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:33:44,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:33:44,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805134360] [2022-12-13 12:33:44,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805134360] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:33:44,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413146618] [2022-12-13 12:33:44,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 12:33:44,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:33:44,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:33:44,656 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:33:44,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-12-13 12:33:44,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 12:33:44,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 12:33:44,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 194 conjunts are in the unsatisfiable core [2022-12-13 12:33:44,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:33:44,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:33:45,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:33:45,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:33:45,316 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:33:45,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:33:46,187 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 12:33:46,187 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-12-13 12:33:46,217 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 12:33:46,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-13 12:33:46,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:33:46,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:33:47,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:33:47,367 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 34 [2022-12-13 12:33:47,373 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:33:47,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:33:48,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:48,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:48,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:48,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:48,406 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:33:48,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 41 [2022-12-13 12:33:48,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:48,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:48,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:33:48,425 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 12:33:48,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 64 [2022-12-13 12:33:48,449 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 12:33:48,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-13 12:33:48,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-12-13 12:33:50,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:50,111 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:33:50,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:50,158 INFO L321 Elim1Store]: treesize reduction 137, result has 18.5 percent of original size [2022-12-13 12:33:50,158 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 155 treesize of output 96 [2022-12-13 12:33:50,191 INFO L321 Elim1Store]: treesize reduction 86, result has 18.9 percent of original size [2022-12-13 12:33:50,191 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 352 treesize of output 296 [2022-12-13 12:33:54,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 12:33:54,143 INFO L321 Elim1Store]: treesize reduction 90, result has 12.6 percent of original size [2022-12-13 12:33:54,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 471 treesize of output 123 [2022-12-13 12:33:54,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:33:54,163 INFO L321 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-12-13 12:33:54,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 33 [2022-12-13 12:33:54,168 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 23 treesize of output 15 [2022-12-13 12:33:54,250 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 11 proven. 36 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 12:33:54,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:34:07,149 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4995 Int)) (or (not (<= v_ArrVal_4995 8)) (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| Int)) (or (forall ((v_ArrVal_4981 (Array Int Int)) (v_ArrVal_4996 Int) (v_ArrVal_4997 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 4 0) 0 v_ArrVal_4996))) (.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 4 0) 0 v_ArrVal_4997)))) (let ((.cse12 (select (select .cse9 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse13 (+ (select (select .cse11 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse10 (select (select .cse9 .cse12) .cse13))) (let ((.cse6 (store .cse11 .cse10 v_ArrVal_4981))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (store .cse9 .cse10 (store (select .cse9 .cse10) (+ (select (select .cse11 .cse12) .cse13) 4) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|)))) (let ((.cse7 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (+ .cse5 4))) (let ((.cse0 (store |c_#length| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| v_ArrVal_4995)) (.cse3 (select (select .cse2 .cse7) .cse8)) (.cse4 (select (select .cse6 .cse7) .cse8))) (or (forall ((v_subst_3 Int)) (let ((.cse1 (select (select .cse2 .cse3) (+ 4 .cse4)))) (or (<= (+ v_subst_3 1) 0) (not (<= (+ 8 v_subst_3) (select .cse0 .cse1))) (= (select (select .cse2 .cse1) (+ 4 v_subst_3)) 0)))) (not (<= 0 .cse5)) (not (<= (+ 8 .cse4) (select .cse0 .cse3))) (not (<= 0 .cse4))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 0)) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_4995 Int)) (or (forall ((|v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 0)) (forall ((v_ArrVal_4981 (Array Int Int)) (v_ArrVal_4996 Int) (v_ArrVal_4997 Int)) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 4 0) 0 v_ArrVal_4996))) (.cse23 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|) 4 0) 0 v_ArrVal_4997)))) (let ((.cse26 (select (select .cse23 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (.cse27 (+ (select (select .cse25 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) 4))) (let ((.cse24 (select (select .cse23 .cse26) .cse27))) (let ((.cse17 (store .cse25 .cse24 v_ArrVal_4981))) (let ((.cse14 (select (select .cse17 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store .cse23 .cse24 (store (select .cse23 .cse24) (+ (select (select .cse25 .cse26) .cse27) 4) |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59|)))) (let ((.cse21 (select (select .cse18 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse22 (+ .cse14 4))) (let ((.cse15 (store |c_#length| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| v_ArrVal_4995)) (.cse19 (select (select .cse18 .cse21) .cse22)) (.cse20 (select (select .cse17 .cse21) .cse22))) (or (not (<= 0 .cse14)) (forall ((v_subst_4 Int)) (let ((.cse16 (select (select .cse18 .cse19) (+ 4 .cse20)))) (or (not (<= (+ 8 v_subst_4) (select .cse15 .cse16))) (<= (+ v_subst_4 1) 0) (= (select (select .cse17 .cse16) (+ 4 v_subst_4)) 0)))) (not (<= (+ 8 .cse20) (select .cse15 .cse19))) (not (<= 0 .cse20))))))))))) (not (< |v_ULTIMATE.start_sll_append_#t~ret7#1.base_59| |c_#StackHeapBarrier|)))) (not (<= v_ArrVal_4995 8))))) is different from false [2022-12-13 12:34:07,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413146618] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:07,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:34:07,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43] total 84 [2022-12-13 12:34:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719571383] [2022-12-13 12:34:07,160 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:34:07,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2022-12-13 12:34:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:34:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2022-12-13 12:34:07,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=9948, Unknown=81, NotChecked=200, Total=10506 [2022-12-13 12:34:07,162 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 84 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 74 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:34:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:34:30,859 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2022-12-13 12:34:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-12-13 12:34:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 84 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 74 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2022-12-13 12:34:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:34:30,860 INFO L225 Difference]: With dead ends: 87 [2022-12-13 12:34:30,861 INFO L226 Difference]: Without dead ends: 87 [2022-12-13 12:34:30,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2470 ImplicationChecksByTransitivity, 38.7s TimeCoverageRelationStatistics Valid=1068, Invalid=16945, Unknown=81, NotChecked=266, Total=18360 [2022-12-13 12:34:30,862 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 1126 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 3234 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1221 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 3234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2022-12-13 12:34:30,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1221 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 3234 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2022-12-13 12:34:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-12-13 12:34:30,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-12-13 12:34:30,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 70 states have internal predecessors, (71), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:34:30,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-12-13 12:34:30,863 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 75 [2022-12-13 12:34:30,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:34:30,864 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-12-13 12:34:30,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 82 states have (on average 1.5975609756097562) internal successors, (131), 74 states have internal predecessors, (131), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:34:30,864 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-12-13 12:34:30,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 12:34:30,864 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:34:30,864 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:34:30,869 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-12-13 12:34:31,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2022-12-13 12:34:31,065 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:34:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:34:31,066 INFO L85 PathProgramCache]: Analyzing trace with hash -61181527, now seen corresponding path program 1 times [2022-12-13 12:34:31,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:34:31,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53652519] [2022-12-13 12:34:31,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:31,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:34:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:34:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:34:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:31,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:34:31,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:31,198 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 12:34:31,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:34:31,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53652519] [2022-12-13 12:34:31,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53652519] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:31,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913662759] [2022-12-13 12:34:31,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:31,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:34:31,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:34:31,200 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:34:31,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-12-13 12:34:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:31,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 12:34:31,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:34:31,496 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 17 treesize of output 9 [2022-12-13 12:34:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 12:34:31,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 12:34:31,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913662759] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 12:34:31,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 12:34:31,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 8 [2022-12-13 12:34:31,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001416481] [2022-12-13 12:34:31,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:34:31,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 12:34:31,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:34:31,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 12:34:31,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-12-13 12:34:31,503 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:34:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:34:31,616 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-12-13 12:34:31,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 12:34:31,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-12-13 12:34:31,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:34:31,616 INFO L225 Difference]: With dead ends: 84 [2022-12-13 12:34:31,616 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 12:34:31,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-12-13 12:34:31,617 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:34:31,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 199 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:34:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 12:34:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 76. [2022-12-13 12:34:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 71 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:34:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-12-13 12:34:31,618 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 77 [2022-12-13 12:34:31,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:34:31,618 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-12-13 12:34:31,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.666666666666667) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:34:31,619 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-12-13 12:34:31,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-12-13 12:34:31,619 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:34:31,619 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:34:31,624 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-12-13 12:34:31,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-12-13 12:34:31,820 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:34:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:34:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash -61181526, now seen corresponding path program 1 times [2022-12-13 12:34:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:34:31,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809912429] [2022-12-13 12:34:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:31,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:34:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:32,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:34:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:32,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:34:32,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:32,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:34:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 12:34:32,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:34:32,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809912429] [2022-12-13 12:34:32,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809912429] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:32,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234244193] [2022-12-13 12:34:32,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:32,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:34:32,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:34:32,084 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:34:32,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-12-13 12:34:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:32,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-13 12:34:32,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:34:32,427 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 23 treesize of output 15 [2022-12-13 12:34:32,430 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 26 treesize of output 14 [2022-12-13 12:34:32,443 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 12:34:32,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:34:32,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:34:32,616 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 34 treesize of output 38 [2022-12-13 12:34:32,691 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-12-13 12:34:32,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234244193] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:32,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:34:32,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 15 [2022-12-13 12:34:32,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069841153] [2022-12-13 12:34:32,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:34:32,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 12:34:32,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:34:32,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 12:34:32,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-12-13 12:34:32,693 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:34:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:34:32,953 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-12-13 12:34:32,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 12:34:32,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 77 [2022-12-13 12:34:32,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:34:32,954 INFO L225 Difference]: With dead ends: 79 [2022-12-13 12:34:32,954 INFO L226 Difference]: Without dead ends: 79 [2022-12-13 12:34:32,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2022-12-13 12:34:32,954 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 63 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:34:32,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 195 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:34:32,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-12-13 12:34:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2022-12-13 12:34:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 71 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:34:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-12-13 12:34:32,957 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 77 [2022-12-13 12:34:32,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:34:32,957 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-12-13 12:34:32,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.285714285714286) internal successors, (51), 8 states have internal predecessors, (51), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:34:32,957 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-12-13 12:34:32,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-12-13 12:34:32,958 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:34:32,958 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:34:32,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-12-13 12:34:33,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-12-13 12:34:33,159 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:34:33,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:34:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1896628737, now seen corresponding path program 1 times [2022-12-13 12:34:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:34:33,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266591266] [2022-12-13 12:34:33,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:33,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:34:33,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:33,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:34:33,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:33,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:34:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:33,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:34:33,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:33,993 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 12:34:33,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:34:33,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266591266] [2022-12-13 12:34:33,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266591266] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:33,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855716501] [2022-12-13 12:34:33,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:34:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:34:33,994 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:34:33,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-12-13 12:34:34,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:34,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 12:34:34,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:34:34,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:34:34,357 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5499 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5499))))) is different from true [2022-12-13 12:34:34,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:34:34,407 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5500 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5500))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-12-13 12:34:34,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:34:34,465 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (not (= |node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_5501 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5501))))) is different from true [2022-12-13 12:34:34,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:34:34,620 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:34:34,620 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-12-13 12:34:34,714 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 16 treesize of output 8 [2022-12-13 12:34:34,718 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 18 not checked. [2022-12-13 12:34:34,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:34:34,826 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 19 treesize of output 11 [2022-12-13 12:34:35,510 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2022-12-13 12:34:35,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855716501] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:35,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:34:35,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [23, 12] total 36 [2022-12-13 12:34:35,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940902040] [2022-12-13 12:34:35,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 12:34:35,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 12:34:35,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:34:35,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 12:34:35,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=957, Unknown=3, NotChecked=192, Total=1260 [2022-12-13 12:34:35,511 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:34:35,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:34:35,716 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-12-13 12:34:35,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 12:34:35,716 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 78 [2022-12-13 12:34:35,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:34:35,717 INFO L225 Difference]: With dead ends: 76 [2022-12-13 12:34:35,717 INFO L226 Difference]: Without dead ends: 76 [2022-12-13 12:34:35,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 140 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=153, Invalid=1262, Unknown=3, NotChecked=222, Total=1640 [2022-12-13 12:34:35,717 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 129 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 12:34:35,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 124 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 12:34:35,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-12-13 12:34:35,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-12-13 12:34:35,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 71 states have internal predecessors, (72), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:34:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-12-13 12:34:35,719 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 78 [2022-12-13 12:34:35,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:34:35,719 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-12-13 12:34:35,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 12:34:35,719 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-12-13 12:34:35,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-12-13 12:34:35,719 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:34:35,719 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:34:35,725 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-12-13 12:34:35,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:34:35,920 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:34:35,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:34:35,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1334098057, now seen corresponding path program 1 times [2022-12-13 12:34:35,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:34:35,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137696987] [2022-12-13 12:34:35,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:35,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:34:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:36,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:34:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:34:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:34:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:36,669 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 12:34:36,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:34:36,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137696987] [2022-12-13 12:34:36,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137696987] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:36,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292002720] [2022-12-13 12:34:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:36,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:34:36,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:34:36,670 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:34:36,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-12-13 12:34:36,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:36,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 52 conjunts are in the unsatisfiable core [2022-12-13 12:34:36,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:34:37,180 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 8 treesize of output 4 [2022-12-13 12:34:37,184 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 7 treesize of output 3 [2022-12-13 12:34:37,268 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5678 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_~temp~0#1.base| v_ArrVal_5678))) (exists ((v_ArrVal_5677 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5677)))) is different from true [2022-12-13 12:34:37,277 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5679 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_5679))) (exists ((v_ArrVal_5680 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_5680))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 12:34:37,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:34:37,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 12:34:37,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:34:37,306 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 15 treesize of output 17 [2022-12-13 12:34:37,382 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:34:37,383 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 18 treesize of output 22 [2022-12-13 12:34:37,482 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-12-13 12:34:37,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-12-13 12:34:37,515 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:34:37,522 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 4 not checked. [2022-12-13 12:34:37,522 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:34:38,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292002720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:38,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:34:38,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 35 [2022-12-13 12:34:38,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801825776] [2022-12-13 12:34:38,113 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:34:38,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-12-13 12:34:38,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:34:38,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-12-13 12:34:38,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1203, Unknown=17, NotChecked=142, Total=1482 [2022-12-13 12:34:38,114 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 36 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 31 states have internal predecessors, (97), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 12:34:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:34:39,255 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-12-13 12:34:39,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 12:34:39,256 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 31 states have internal predecessors, (97), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 79 [2022-12-13 12:34:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:34:39,257 INFO L225 Difference]: With dead ends: 78 [2022-12-13 12:34:39,257 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 12:34:39,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 106 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=387, Invalid=2464, Unknown=19, NotChecked=210, Total=3080 [2022-12-13 12:34:39,257 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 518 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 12:34:39,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 358 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 581 Invalid, 0 Unknown, 130 Unchecked, 0.4s Time] [2022-12-13 12:34:39,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 12:34:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-12-13 12:34:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 73 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:34:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-12-13 12:34:39,260 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 79 [2022-12-13 12:34:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:34:39,260 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-12-13 12:34:39,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.9393939393939394) internal successors, (97), 31 states have internal predecessors, (97), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 12:34:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-12-13 12:34:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-12-13 12:34:39,261 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:34:39,261 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:34:39,266 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-12-13 12:34:39,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-12-13 12:34:39,462 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:34:39,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:34:39,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1592633024, now seen corresponding path program 1 times [2022-12-13 12:34:39,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:34:39,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654575621] [2022-12-13 12:34:39,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:39,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:34:39,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:40,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:34:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:40,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:34:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:40,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:34:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:40,506 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 12:34:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:34:40,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654575621] [2022-12-13 12:34:40,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654575621] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:40,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203894390] [2022-12-13 12:34:40,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:40,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:34:40,507 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:34:40,507 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:34:40,508 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-12-13 12:34:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:40,732 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 30 conjunts are in the unsatisfiable core [2022-12-13 12:34:40,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:34:41,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-12-13 12:34:41,220 WARN L859 $PredicateComparison]: unable to prove that (and (< |c_node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_5857 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_~temp~0#1.base| v_ArrVal_5857)))) is different from true [2022-12-13 12:34:41,227 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5858 (Array Int Int))) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_5858) |c_#memory_$Pointer$.base|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 12:34:41,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:34:41,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-12-13 12:34:41,506 INFO L321 Elim1Store]: treesize reduction 31, result has 38.0 percent of original size [2022-12-13 12:34:41,506 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 38 treesize of output 38 [2022-12-13 12:34:41,669 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 23 treesize of output 11 [2022-12-13 12:34:41,834 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 21 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 4 not checked. [2022-12-13 12:34:41,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:34:46,744 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5864 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5864))) (or (<= (+ (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int)) (or (= |ULTIMATE.start_sll_append_~last~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (not (= (select (select .cse0 |ULTIMATE.start_sll_append_~last~0#1.base|) (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0)))))))))) (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (forall ((v_ArrVal_5864 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5864))) (or (<= (+ (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (forall ((|ULTIMATE.start_sll_append_~last~0#1.base| Int)) (not (= (select (select .cse1 |ULTIMATE.start_sll_append_~last~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))) (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)))) (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5864 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5864) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))) (forall ((|v_node_create_~temp~0#1.base_115| Int)) (or (not (< |v_node_create_~temp~0#1.base_115| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_5864 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_115| v_ArrVal_5864) |c_ULTIMATE.start_main_~#s~0#1.base|))) (or (<= (+ (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.offset|) 1) |c_#StackHeapBarrier|) (forall ((|ULTIMATE.start_sll_append_~last~0#1.offset| Int)) (not (= (select .cse2 (+ |ULTIMATE.start_sll_append_~last~0#1.offset| 4)) 0))))))))) is different from false [2022-12-13 12:34:46,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203894390] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:46,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:34:46,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 17] total 38 [2022-12-13 12:34:46,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060803332] [2022-12-13 12:34:46,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:34:46,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-12-13 12:34:46,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:34:46,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-12-13 12:34:46,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1353, Unknown=3, NotChecked=228, Total=1722 [2022-12-13 12:34:46,749 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 39 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 35 states have internal predecessors, (120), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 12:34:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:34:49,061 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2022-12-13 12:34:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 12:34:49,061 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 35 states have internal predecessors, (120), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 80 [2022-12-13 12:34:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:34:49,061 INFO L225 Difference]: With dead ends: 80 [2022-12-13 12:34:49,061 INFO L226 Difference]: Without dead ends: 80 [2022-12-13 12:34:49,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=414, Invalid=2672, Unknown=6, NotChecked=330, Total=3422 [2022-12-13 12:34:49,062 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 555 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 555 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 12:34:49,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [555 Valid, 435 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 746 Invalid, 0 Unknown, 140 Unchecked, 0.7s Time] [2022-12-13 12:34:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-13 12:34:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-12-13 12:34:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.0714285714285714) internal successors, (75), 74 states have internal predecessors, (75), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:34:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-12-13 12:34:49,063 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 80 [2022-12-13 12:34:49,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:34:49,063 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-12-13 12:34:49,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 35 states have internal predecessors, (120), 3 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2022-12-13 12:34:49,063 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-12-13 12:34:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-13 12:34:49,064 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:34:49,064 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:34:49,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-12-13 12:34:49,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-12-13 12:34:49,265 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:34:49,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:34:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash 373470414, now seen corresponding path program 1 times [2022-12-13 12:34:49,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:34:49,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374933060] [2022-12-13 12:34:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:49,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:34:49,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:50,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:34:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:51,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:34:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:51,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:34:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:51,886 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 12:34:51,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:34:51,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374933060] [2022-12-13 12:34:51,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374933060] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:51,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230542725] [2022-12-13 12:34:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:34:51,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:34:51,886 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:34:51,887 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:34:51,888 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-12-13 12:34:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:34:52,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-13 12:34:52,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:34:52,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 12:34:52,799 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 12:34:52,799 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-13 12:34:52,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 12:34:53,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:34:53,483 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:34:53,484 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 18 [2022-12-13 12:34:53,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 12:34:53,749 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_6038 (Array Int Int)) (v_ArrVal_6037 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_6038) |c_#memory_$Pointer$.base|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_6037)))) is different from true [2022-12-13 12:34:53,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:34:53,801 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 12:34:53,801 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 55 [2022-12-13 12:34:53,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:34:53,810 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 62 treesize of output 58 [2022-12-13 12:34:53,818 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:34:53,818 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-12-13 12:34:54,005 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 63 treesize of output 43 [2022-12-13 12:34:54,729 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 12:34:54,729 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 65 treesize of output 56 [2022-12-13 12:34:55,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:34:55,842 INFO L321 Elim1Store]: treesize reduction 4, result has 85.2 percent of original size [2022-12-13 12:34:55,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 65 treesize of output 46 [2022-12-13 12:34:56,350 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 12:34:56,355 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 6 not checked. [2022-12-13 12:34:56,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 12:34:57,272 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_6039))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse0 |c_#StackHeapBarrier|)) (not (= (select (select .cse1 .cse0) 4) .cse0)))))) (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_6039))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse2 |c_#StackHeapBarrier|)) (= (select |c_#valid| (select (select .cse3 .cse2) 4)) 1)))))) is different from false [2022-12-13 12:34:57,298 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:34:57,298 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 76 treesize of output 80 [2022-12-13 12:34:57,337 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_89 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_prenex_89))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse0 |c_#StackHeapBarrier|)) (not (= (select (select .cse1 .cse0) 4) .cse0)))))) (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_6039))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse2 |c_#StackHeapBarrier|)) (= (select (select .cse3 .cse2) 4) |c_ULTIMATE.start_sll_append_~last~0#1.base|)))))) is different from false [2022-12-13 12:34:57,354 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_89 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_prenex_89))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) .cse1)) (not (< .cse1 |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem10#1.base| v_ArrVal_6039))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse2 |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_sll_append_#t~mem10#1.base| (select (select .cse3 .cse2) 4))))))) is different from false [2022-12-13 12:34:57,370 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (+ |c_ULTIMATE.start_sll_append_~last~0#1.offset| 4)))) (and (forall ((v_prenex_89 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_89))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 .cse0) 4))) (not (< .cse0 |c_#StackHeapBarrier|)))))) (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6039))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse3 |c_#StackHeapBarrier|)) (= (select (select .cse4 .cse3) 4) .cse2))))))) is different from false [2022-12-13 12:34:57,412 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_#t~mem9#1.base|) (+ |c_ULTIMATE.start_sll_append_#t~mem9#1.offset| 4)))) (and (forall ((v_ArrVal_6039 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_6039))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) 4) .cse2) (not (< .cse1 |c_#StackHeapBarrier|)))))) (forall ((v_prenex_89 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_prenex_89))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (< .cse3 |c_#StackHeapBarrier|)) (not (= .cse3 (select (select .cse4 .cse3) 4))))))))) is different from false [2022-12-13 12:34:58,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230542725] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:34:58,138 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 12:34:58,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 36] total 69 [2022-12-13 12:34:58,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66214184] [2022-12-13 12:34:58,138 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 12:34:58,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-13 12:34:58,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 12:34:58,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-13 12:34:58,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=5589, Unknown=20, NotChecked=930, Total=6806 [2022-12-13 12:34:58,140 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 70 states, 67 states have (on average 2.014925373134328) internal successors, (135), 63 states have internal predecessors, (135), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:35:04,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 12:35:04,814 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-12-13 12:35:04,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-12-13 12:35:04,815 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 2.014925373134328) internal successors, (135), 63 states have internal predecessors, (135), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 83 [2022-12-13 12:35:04,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 12:35:04,815 INFO L225 Difference]: With dead ends: 84 [2022-12-13 12:35:04,815 INFO L226 Difference]: Without dead ends: 84 [2022-12-13 12:35:04,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 85 SyntacticMatches, 6 SemanticMatches, 115 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 2690 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=948, Invalid=11266, Unknown=20, NotChecked=1338, Total=13572 [2022-12-13 12:35:04,816 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 350 mSDsluCounter, 781 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 2139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-12-13 12:35:04,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 808 Invalid, 2139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 2036 Invalid, 0 Unknown, 81 Unchecked, 1.9s Time] [2022-12-13 12:35:04,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-12-13 12:35:04,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-12-13 12:35:04,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 73 states have (on average 1.095890410958904) internal successors, (80), 77 states have internal predecessors, (80), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-13 12:35:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-12-13 12:35:04,818 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 83 [2022-12-13 12:35:04,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 12:35:04,818 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-12-13 12:35:04,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 2.014925373134328) internal successors, (135), 63 states have internal predecessors, (135), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-12-13 12:35:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-12-13 12:35:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-12-13 12:35:04,818 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 12:35:04,819 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 12:35:04,824 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-12-13 12:35:05,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-12-13 12:35:05,019 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2022-12-13 12:35:05,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 12:35:05,020 INFO L85 PathProgramCache]: Analyzing trace with hash 373470415, now seen corresponding path program 1 times [2022-12-13 12:35:05,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 12:35:05,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427290328] [2022-12-13 12:35:05,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:35:05,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 12:35:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:35:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-12-13 12:35:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:35:05,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-12-13 12:35:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:35:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-12-13 12:35:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:35:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2022-12-13 12:35:05,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 12:35:05,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427290328] [2022-12-13 12:35:05,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427290328] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 12:35:05,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648137465] [2022-12-13 12:35:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 12:35:05,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 12:35:05,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 12:35:05,841 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 12:35:05,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6f892be7-801d-4eed-9e81-686afd9ba062/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-12-13 12:35:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 12:35:06,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 121 conjunts are in the unsatisfiable core [2022-12-13 12:35:06,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 12:35:06,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-13 12:35:06,698 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 36 treesize of output 20 [2022-12-13 12:35:06,701 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 7 treesize of output 3 [2022-12-13 12:35:06,894 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_6222 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_6222))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_6218 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_6218) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_6221 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_6221))))) is different from true [2022-12-13 12:35:06,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:35:06,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 21 [2022-12-13 12:35:06,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:35:06,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-13 12:35:06,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:35:06,959 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 42 treesize of output 38 [2022-12-13 12:35:06,975 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 12:35:06,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-12-13 12:35:07,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 12:35:07,916 INFO L321 Elim1Store]: treesize reduction 72, result has 38.5 percent of original size [2022-12-13 12:35:07,916 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 6 new quantified variables, introduced 5 case distinctions, treesize of input 228 treesize of output 145 [2022-12-13 12:35:07,960 INFO L321 Elim1Store]: treesize reduction 76, result has 20.0 percent of original size [2022-12-13 12:35:07,960 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 201 treesize of output 118 [2022-12-13 12:35:10,170 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:35:10,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 429 treesize of output 606 [2022-12-13 12:35:10,599 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 12:35:10,600 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 537 treesize of output 606