./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/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_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/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_1f7f206e-094a-4a50-9ed2-98abcec285e0/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 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 --- 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 13:06:54,918 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:06:54,919 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:06:54,938 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:06:54,939 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:06:54,940 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:06:54,941 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:06:54,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:06:54,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:06:54,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:06:54,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:06:54,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:06:54,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:06:54,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:06:54,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:06:54,951 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:06:54,951 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:06:54,952 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:06:54,954 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:06:54,956 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:06:54,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:06:54,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:06:54,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:06:54,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:06:54,963 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:06:54,964 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:06:54,964 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:06:54,965 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:06:54,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:06:54,966 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:06:54,966 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:06:54,967 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:06:54,968 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:06:54,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:06:54,969 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:06:54,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:06:54,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:06:54,970 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:06:54,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:06:54,972 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:06:54,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:06:54,973 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 13:06:54,993 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:06:54,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:06:54,994 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:06:54,998 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:06:54,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:06:54,999 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:06:55,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:06:55,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:06:55,000 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:06:55,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:06:55,000 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:06:55,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:06:55,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:06:55,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:06:55,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:06:55,001 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 13:06:55,001 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 13:06:55,001 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 13:06:55,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:06:55,002 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 13:06:55,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:06:55,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:06:55,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:06:55,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:06:55,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:06:55,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:06:55,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:06:55,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:06:55,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:06:55,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:06:55,004 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:06:55,004 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:06:55,004 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:06:55,004 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:06:55,004 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_1f7f206e-094a-4a50-9ed2-98abcec285e0/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_1f7f206e-094a-4a50-9ed2-98abcec285e0/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 -> 535caea86e22f289c2fcb0364594f5e7b1dfaabfa814e56099346e6a240c0067 [2022-12-13 13:06:55,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:06:55,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:06:55,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:06:55,214 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:06:55,214 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:06:55,215 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-12-13 13:06:57,824 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:06:58,019 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:06:58,019 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-12-13 13:06:58,028 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/data/019d76b9e/0cf0cc1ba1cb416f87c7946d8915222c/FLAGb800aed6a [2022-12-13 13:06:58,039 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/data/019d76b9e/0cf0cc1ba1cb416f87c7946d8915222c [2022-12-13 13:06:58,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:06:58,042 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:06:58,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:06:58,043 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:06:58,045 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:06:58,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62397eb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58, skipping insertion in model container [2022-12-13 13:06:58,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:06:58,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:06:58,334 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_1f7f206e-094a-4a50-9ed2-98abcec285e0/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-12-13 13:06:58,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:06:58,345 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:06:58,383 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_1f7f206e-094a-4a50-9ed2-98abcec285e0/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-12-13 13:06:58,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:06:58,408 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:06:58,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58 WrapperNode [2022-12-13 13:06:58,409 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:06:58,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:06:58,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:06:58,410 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:06:58,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,429 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,452 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 160 [2022-12-13 13:06:58,452 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:06:58,453 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:06:58,453 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:06:58,453 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:06:58,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,465 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,479 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:06:58,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:06:58,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:06:58,484 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:06:58,485 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (1/1) ... [2022-12-13 13:06:58,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:06:58,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:06:58,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:06:58,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:06:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:06:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:06:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-12-13 13:06:58,550 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-12-13 13:06:58,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-12-13 13:06:58,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:06:58,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:06:58,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:06:58,652 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:06:58,654 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:06:58,989 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:06:58,995 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:06:58,995 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-13 13:06:58,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:06:58 BoogieIcfgContainer [2022-12-13 13:06:58,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:06:58,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:06:58,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:06:59,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:06:59,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:06:58" (1/3) ... [2022-12-13 13:06:59,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e6269d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:06:59, skipping insertion in model container [2022-12-13 13:06:59,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:06:58" (2/3) ... [2022-12-13 13:06:59,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e6269d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:06:59, skipping insertion in model container [2022-12-13 13:06:59,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:06:58" (3/3) ... [2022-12-13 13:06:59,003 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-12-13 13:06:59,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:06:59,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-12-13 13:06:59,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:06:59,059 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;@672a5555, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:06:59,059 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-12-13 13:06:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand has 154 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 149 states have internal predecessors, (164), 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 13:06:59,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 13:06:59,066 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:06:59,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 13:06:59,067 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:06:59,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:59,071 INFO L85 PathProgramCache]: Analyzing trace with hash 896534515, now seen corresponding path program 1 times [2022-12-13 13:06:59,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:59,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121588268] [2022-12-13 13:06:59,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:59,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:59,331 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 13:06:59,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:59,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121588268] [2022-12-13 13:06:59,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121588268] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:06:59,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:06:59,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:06:59,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912011273] [2022-12-13 13:06:59,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:06:59,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:06:59,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:59,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:06:59,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:06:59,366 INFO L87 Difference]: Start difference. First operand has 154 states, 77 states have (on average 2.1298701298701297) internal successors, (164), 149 states have internal predecessors, (164), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 13:06:59,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:06:59,500 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-12-13 13:06:59,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:06:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-12-13 13:06:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:06:59,508 INFO L225 Difference]: With dead ends: 151 [2022-12-13 13:06:59,509 INFO L226 Difference]: Without dead ends: 148 [2022-12-13 13:06:59,510 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 13:06:59,512 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:06:59,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 240 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:06:59,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-12-13 13:06:59,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-12-13 13:06:59,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 75 states have (on average 2.026666666666667) internal successors, (152), 143 states have internal predecessors, (152), 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 13:06:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-12-13 13:06:59,543 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 6 [2022-12-13 13:06:59,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:06:59,544 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-12-13 13:06:59,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 13:06:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-12-13 13:06:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 13:06:59,544 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:06:59,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 13:06:59,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:06:59,545 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:06:59,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:59,545 INFO L85 PathProgramCache]: Analyzing trace with hash 896534514, now seen corresponding path program 1 times [2022-12-13 13:06:59,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:59,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364641062] [2022-12-13 13:06:59,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:59,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:59,583 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 13:06:59,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:59,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364641062] [2022-12-13 13:06:59,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364641062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:06:59,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:06:59,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:06:59,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259857254] [2022-12-13 13:06:59,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:06:59,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:06:59,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:06:59,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:06:59,586 INFO L87 Difference]: Start difference. First operand 148 states and 158 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 13:06:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:06:59,672 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2022-12-13 13:06:59,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:06:59,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2022-12-13 13:06:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:06:59,674 INFO L225 Difference]: With dead ends: 145 [2022-12-13 13:06:59,674 INFO L226 Difference]: Without dead ends: 145 [2022-12-13 13:06:59,674 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 13:06:59,675 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:06:59,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 229 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:06:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-13 13:06:59,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-12-13 13:06:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 75 states have (on average 1.9866666666666666) internal successors, (149), 140 states have internal predecessors, (149), 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 13:06:59,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-12-13 13:06:59,681 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 6 [2022-12-13 13:06:59,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:06:59,682 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-12-13 13:06:59,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 13:06:59,682 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-12-13 13:06:59,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-12-13 13:06:59,682 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:06:59,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:59,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:06:59,683 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:06:59,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 976905444, now seen corresponding path program 1 times [2022-12-13 13:06:59,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:59,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661082256] [2022-12-13 13:06:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:59,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:59,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:06:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:06:59,766 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 13:06:59,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:06:59,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661082256] [2022-12-13 13:06:59,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661082256] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:06:59,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:06:59,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:06:59,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747927880] [2022-12-13 13:06:59,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:06:59,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:06:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:06:59,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:06:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:06:59,768 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13:06:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:06:59,902 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2022-12-13 13:06:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:06:59,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-12-13 13:06:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:06:59,904 INFO L225 Difference]: With dead ends: 156 [2022-12-13 13:06:59,904 INFO L226 Difference]: Without dead ends: 156 [2022-12-13 13:06:59,904 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 13:06:59,905 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:06:59,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 352 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:06:59,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-12-13 13:06:59,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2022-12-13 13:06:59,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 141 states have internal predecessors, (150), 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 13:06:59,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2022-12-13 13:06:59,912 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 14 [2022-12-13 13:06:59,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:06:59,912 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2022-12-13 13:06:59,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 13:06:59,912 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2022-12-13 13:06:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 13:06:59,913 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:06:59,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:06:59,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:06:59,913 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:06:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:06:59,913 INFO L85 PathProgramCache]: Analyzing trace with hash 302098592, now seen corresponding path program 1 times [2022-12-13 13:06:59,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:06:59,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983687517] [2022-12-13 13:06:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:06:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:06:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:00,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:00,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:00,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:07:00,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:00,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983687517] [2022-12-13 13:07:00,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983687517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:00,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:00,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:07:00,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307863883] [2022-12-13 13:07:00,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:00,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:07:00,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:00,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:07:00,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:07:00,064 INFO L87 Difference]: Start difference. First operand 146 states and 156 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 13:07:00,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:00,302 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-12-13 13:07:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:07:00,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-12-13 13:07:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:00,305 INFO L225 Difference]: With dead ends: 146 [2022-12-13 13:07:00,305 INFO L226 Difference]: Without dead ends: 146 [2022-12-13 13:07:00,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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 13:07:00,307 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 21 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:00,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 484 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:07:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-13 13:07:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2022-12-13 13:07:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 140 states have internal predecessors, (149), 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 13:07:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-12-13 13:07:00,316 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 24 [2022-12-13 13:07:00,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:00,316 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-12-13 13:07:00,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 13:07:00,316 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-12-13 13:07:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 13:07:00,317 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:00,317 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:00,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:07:00,317 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:00,318 INFO L85 PathProgramCache]: Analyzing trace with hash 302098593, now seen corresponding path program 1 times [2022-12-13 13:07:00,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:00,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089277184] [2022-12-13 13:07:00,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:00,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:00,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:00,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089277184] [2022-12-13 13:07:00,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089277184] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:00,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:00,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:07:00,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77018183] [2022-12-13 13:07:00,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:00,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:07:00,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:00,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:07:00,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:07:00,552 INFO L87 Difference]: Start difference. First operand 145 states and 155 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 13:07:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:00,790 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-12-13 13:07:00,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:07:00,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-12-13 13:07:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:00,791 INFO L225 Difference]: With dead ends: 145 [2022-12-13 13:07:00,791 INFO L226 Difference]: Without dead ends: 145 [2022-12-13 13:07:00,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 13:07:00,793 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 19 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:00,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 508 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:07:00,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-13 13:07:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2022-12-13 13:07:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 76 states have (on average 1.9473684210526316) internal successors, (148), 139 states have internal predecessors, (148), 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 13:07:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2022-12-13 13:07:00,800 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 24 [2022-12-13 13:07:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:00,800 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2022-12-13 13:07:00,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 13:07:00,800 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2022-12-13 13:07:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 13:07:00,801 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:00,801 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:00,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:07:00,802 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:00,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:00,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029503, now seen corresponding path program 1 times [2022-12-13 13:07:00,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:00,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733930587] [2022-12-13 13:07:00,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:00,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:00,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:01,071 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:01,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:01,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733930587] [2022-12-13 13:07:01,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733930587] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:01,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875151984] [2022-12-13 13:07:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:01,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:01,072 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:01,073 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:01,075 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 13:07:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:01,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-12-13 13:07:01,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:01,208 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 13:07:01,262 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_352 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_352))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 13:07:01,349 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:07:01,349 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 13:07:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-13 13:07:01,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:01,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875151984] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:01,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:07:01,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-12-13 13:07:01,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472459233] [2022-12-13 13:07:01,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:01,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:07:01,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:01,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:07:01,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-12-13 13:07:01,413 INFO L87 Difference]: Start difference. First operand 144 states and 154 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:01,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:01,748 INFO L93 Difference]: Finished difference Result 169 states and 182 transitions. [2022-12-13 13:07:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:07:01,749 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-12-13 13:07:01,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:01,750 INFO L225 Difference]: With dead ends: 169 [2022-12-13 13:07:01,750 INFO L226 Difference]: Without dead ends: 169 [2022-12-13 13:07:01,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2022-12-13 13:07:01,751 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 124 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:01,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 457 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 495 Invalid, 0 Unknown, 175 Unchecked, 0.3s Time] [2022-12-13 13:07:01,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-12-13 13:07:01,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 149. [2022-12-13 13:07:01,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.925) internal successors, (154), 143 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 13:07:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2022-12-13 13:07:01,759 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 26 [2022-12-13 13:07:01,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:01,759 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2022-12-13 13:07:01,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:01,760 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2022-12-13 13:07:01,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 13:07:01,760 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:01,760 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:01,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:07:01,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-13 13:07:01,961 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:01,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029502, now seen corresponding path program 1 times [2022-12-13 13:07:01,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:01,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823002062] [2022-12-13 13:07:01,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:01,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:02,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:02,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:02,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:02,350 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:02,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:02,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823002062] [2022-12-13 13:07:02,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823002062] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:02,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2105358007] [2022-12-13 13:07:02,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:02,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:02,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:02,352 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:02,353 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 13:07:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:02,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-12-13 13:07:02,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:02,461 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 13:07:02,613 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_493 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_493) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 13:07:02,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:02,670 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 14 treesize of output 16 [2022-12-13 13:07:02,678 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:07:02,678 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 13:07:02,709 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-12-13 13:07:02,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:06,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2105358007] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:06,861 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:07:06,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2022-12-13 13:07:06,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177016190] [2022-12-13 13:07:06,862 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:06,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 13:07:06,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:06,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 13:07:06,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2022-12-13 13:07:06,863 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:07:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:07,538 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2022-12-13 13:07:07,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:07:07,538 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-12-13 13:07:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:07,539 INFO L225 Difference]: With dead ends: 151 [2022-12-13 13:07:07,539 INFO L226 Difference]: Without dead ends: 151 [2022-12-13 13:07:07,539 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2022-12-13 13:07:07,540 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 7 mSDsluCounter, 797 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:07,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 940 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1183 Invalid, 0 Unknown, 156 Unchecked, 0.6s Time] [2022-12-13 13:07:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-12-13 13:07:07,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-12-13 13:07:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.9125) internal successors, (153), 143 states have internal predecessors, (153), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 13:07:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-12-13 13:07:07,546 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 26 [2022-12-13 13:07:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:07,546 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-12-13 13:07:07,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 15 states have internal predecessors, (42), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-12-13 13:07:07,547 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-12-13 13:07:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 13:07:07,547 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:07,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:07,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-13 13:07:07,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:07,748 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:07,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1908047191, now seen corresponding path program 1 times [2022-12-13 13:07:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:07,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789253224] [2022-12-13 13:07:07,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:07,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:07,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:07,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:07,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:07,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789253224] [2022-12-13 13:07:07,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789253224] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:07,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571937967] [2022-12-13 13:07:07,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:07,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:07,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:07,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:07,848 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 13:07:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:07,940 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 13:07:07,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:07,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:07,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:07,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571937967] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:07:07,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:07:07,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-12-13 13:07:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47832263] [2022-12-13 13:07:07,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:07,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:07:07,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:07,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:07:07,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:07:07,993 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:07:08,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:08,152 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2022-12-13 13:07:08,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:07:08,152 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-12-13 13:07:08,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:08,153 INFO L225 Difference]: With dead ends: 150 [2022-12-13 13:07:08,154 INFO L226 Difference]: Without dead ends: 150 [2022-12-13 13:07:08,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 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 13:07:08,155 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 4 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:08,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 750 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:07:08,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-13 13:07:08,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-12-13 13:07:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 80 states have (on average 1.9) internal successors, (152), 143 states have internal predecessors, (152), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 13:07:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-12-13 13:07:08,160 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 28 [2022-12-13 13:07:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:08,160 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-12-13 13:07:08,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 13:07:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-12-13 13:07:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 13:07:08,161 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:08,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:08,166 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 13:07:08,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:08,363 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:08,364 INFO L85 PathProgramCache]: Analyzing trace with hash -984859886, now seen corresponding path program 1 times [2022-12-13 13:07:08,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:08,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582698720] [2022-12-13 13:07:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:08,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:08,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:08,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 13:07:08,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:08,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582698720] [2022-12-13 13:07:08,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582698720] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:08,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888084439] [2022-12-13 13:07:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:08,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:08,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:08,494 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:08,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 13:07:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:08,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-13 13:07:08,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:08,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 13:07:08,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:08,616 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 13:07:08,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 12 treesize of output 11 [2022-12-13 13:07:08,635 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 13:07:08,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888084439] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:07:08,635 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:07:08,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-12-13 13:07:08,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886116723] [2022-12-13 13:07:08,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:08,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:07:08,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:07:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:07:08,637 INFO L87 Difference]: Start difference. First operand 149 states and 160 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:08,796 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-12-13 13:07:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:07:08,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-12-13 13:07:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:08,797 INFO L225 Difference]: With dead ends: 154 [2022-12-13 13:07:08,797 INFO L226 Difference]: Without dead ends: 154 [2022-12-13 13:07:08,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:07:08,798 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 12 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:08,798 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 351 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:07:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-12-13 13:07:08,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-12-13 13:07:08,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.891566265060241) internal successors, (157), 146 states have internal predecessors, (157), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 13:07:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-12-13 13:07:08,801 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 29 [2022-12-13 13:07:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:08,801 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-12-13 13:07:08,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-12-13 13:07:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-13 13:07:08,802 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:08,802 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:08,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 13:07:09,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:09,004 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:09,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:09,005 INFO L85 PathProgramCache]: Analyzing trace with hash -984859885, now seen corresponding path program 1 times [2022-12-13 13:07:09,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:09,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057975496] [2022-12-13 13:07:09,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:09,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:09,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:09,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:09,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057975496] [2022-12-13 13:07:09,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057975496] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:09,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293618897] [2022-12-13 13:07:09,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:09,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:09,209 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:09,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:09,211 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 13:07:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:09,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-13 13:07:09,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:09,409 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:09,409 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:09,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:07:09,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-12-13 13:07:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:09,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293618897] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:07:09,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:07:09,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-12-13 13:07:09,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996900533] [2022-12-13 13:07:09,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:09,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-13 13:07:09,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:09,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-13 13:07:09,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-12-13 13:07:09,550 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-13 13:07:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:09,812 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-12-13 13:07:09,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:07:09,812 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-12-13 13:07:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:09,813 INFO L225 Difference]: With dead ends: 159 [2022-12-13 13:07:09,813 INFO L226 Difference]: Without dead ends: 159 [2022-12-13 13:07:09,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-12-13 13:07:09,813 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 21 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1422 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:09,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1422 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:07:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-12-13 13:07:09,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2022-12-13 13:07:09,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.8795180722891567) internal successors, (156), 146 states have internal predecessors, (156), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 13:07:09,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-12-13 13:07:09,817 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 29 [2022-12-13 13:07:09,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:09,817 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-12-13 13:07:09,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-12-13 13:07:09,817 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-12-13 13:07:09,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 13:07:09,817 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:09,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:09,822 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-13 13:07:10,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:10,019 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:10,021 INFO L85 PathProgramCache]: Analyzing trace with hash -465885389, now seen corresponding path program 1 times [2022-12-13 13:07:10,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:10,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533173084] [2022-12-13 13:07:10,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:10,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:07:10,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:10,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533173084] [2022-12-13 13:07:10,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533173084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:10,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:10,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:07:10,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621691313] [2022-12-13 13:07:10,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:10,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:07:10,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:10,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:07:10,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:07:10,184 INFO L87 Difference]: Start difference. First operand 152 states and 164 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 13:07:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:10,409 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-12-13 13:07:10,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:07:10,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-12-13 13:07:10,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:10,410 INFO L225 Difference]: With dead ends: 152 [2022-12-13 13:07:10,410 INFO L226 Difference]: Without dead ends: 152 [2022-12-13 13:07:10,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:07:10,410 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 24 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:10,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 542 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:07:10,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-12-13 13:07:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2022-12-13 13:07:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 83 states have (on average 1.8674698795180722) internal successors, (155), 145 states have internal predecessors, (155), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 13:07:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2022-12-13 13:07:10,413 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 30 [2022-12-13 13:07:10,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:10,413 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-12-13 13:07:10,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 13:07:10,413 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2022-12-13 13:07:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-13 13:07:10,414 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:10,414 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:10,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:07:10,414 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:10,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:10,414 INFO L85 PathProgramCache]: Analyzing trace with hash -465885388, now seen corresponding path program 1 times [2022-12-13 13:07:10,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:10,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072661825] [2022-12-13 13:07:10,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:10,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:10,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:07:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:10,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072661825] [2022-12-13 13:07:10,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072661825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:10,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:10,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:07:10,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350259730] [2022-12-13 13:07:10,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:10,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:07:10,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:07:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:07:10,568 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 13:07:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:10,822 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2022-12-13 13:07:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:07:10,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-12-13 13:07:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:10,822 INFO L225 Difference]: With dead ends: 150 [2022-12-13 13:07:10,823 INFO L226 Difference]: Without dead ends: 150 [2022-12-13 13:07:10,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:07:10,823 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:10,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 572 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:07:10,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-12-13 13:07:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-12-13 13:07:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 83 states have (on average 1.855421686746988) internal successors, (154), 144 states have internal predecessors, (154), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-12-13 13:07:10,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2022-12-13 13:07:10,826 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 30 [2022-12-13 13:07:10,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:10,826 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2022-12-13 13:07:10,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-12-13 13:07:10,826 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2022-12-13 13:07:10,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-13 13:07:10,826 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:10,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:07:10,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:07:10,827 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:10,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1959133359, now seen corresponding path program 1 times [2022-12-13 13:07:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:10,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038839483] [2022-12-13 13:07:10,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:10,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-12-13 13:07:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:10,915 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 13:07:10,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:10,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038839483] [2022-12-13 13:07:10,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038839483] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:10,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589735715] [2022-12-13 13:07:10,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:10,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:10,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:10,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:10,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-13 13:07:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:11,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:07:11,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-13 13:07:11,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:07:11,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589735715] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:11,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:07:11,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-12-13 13:07:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122519860] [2022-12-13 13:07:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:11,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:07:11,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:11,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:07:11,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:07:11,068 INFO L87 Difference]: Start difference. First operand 150 states and 162 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:11,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:11,079 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-12-13 13:07:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:07:11,080 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-12-13 13:07:11,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:11,080 INFO L225 Difference]: With dead ends: 138 [2022-12-13 13:07:11,081 INFO L226 Difference]: Without dead ends: 138 [2022-12-13 13:07:11,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:07:11,081 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:11,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 170 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 13:07:11,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-12-13 13:07:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-12-13 13:07:11,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.8421052631578947) internal successors, (140), 133 states have internal predecessors, (140), 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 13:07:11,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2022-12-13 13:07:11,085 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 41 [2022-12-13 13:07:11,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:11,086 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2022-12-13 13:07:11,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:11,086 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-12-13 13:07:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 13:07:11,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:11,087 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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 13:07:11,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-13 13:07:11,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:11,287 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:11,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:11,288 INFO L85 PathProgramCache]: Analyzing trace with hash -930567857, now seen corresponding path program 1 times [2022-12-13 13:07:11,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:11,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161030021] [2022-12-13 13:07:11,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:11,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:11,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:11,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:11,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:11,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:11,704 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 13:07:11,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:11,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161030021] [2022-12-13 13:07:11,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161030021] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:11,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438079104] [2022-12-13 13:07:11,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:11,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:11,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:11,706 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:11,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-13 13:07:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:11,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 13:07:11,847 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:11,851 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 13:07:11,860 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 13:07:11,872 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_1582))) is different from true [2022-12-13 13:07:11,883 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1582 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_1582))) is different from true [2022-12-13 13:07:11,899 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:07:11,900 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 13:07:11,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-13 13:07:11,954 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_1583 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_1583))))) is different from true [2022-12-13 13:07:11,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:11,996 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 16 treesize of output 18 [2022-12-13 13:07:12,037 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2022-12-13 13:07:12,055 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:07:12,055 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 14 [2022-12-13 13:07:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 21 not checked. [2022-12-13 13:07:12,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:14,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438079104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:14,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:07:14,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2022-12-13 13:07:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525733475] [2022-12-13 13:07:14,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:14,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:07:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:14,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:07:14,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=221, Unknown=5, NotChecked=132, Total=420 [2022-12-13 13:07:14,246 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 13:07:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:14,669 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2022-12-13 13:07:14,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:07:14,670 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-12-13 13:07:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:14,671 INFO L225 Difference]: With dead ends: 146 [2022-12-13 13:07:14,671 INFO L226 Difference]: Without dead ends: 146 [2022-12-13 13:07:14,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=87, Invalid=304, Unknown=5, NotChecked=156, Total=552 [2022-12-13 13:07:14,672 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 559 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 561 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 559 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 599 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:14,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [559 Valid, 394 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 561 Invalid, 0 Unknown, 599 Unchecked, 0.4s Time] [2022-12-13 13:07:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-12-13 13:07:14,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 128. [2022-12-13 13:07:14,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 76 states have (on average 1.7105263157894737) internal successors, (130), 123 states have internal predecessors, (130), 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 13:07:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2022-12-13 13:07:14,676 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 43 [2022-12-13 13:07:14,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:14,676 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2022-12-13 13:07:14,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2022-12-13 13:07:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-12-13 13:07:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 13:07:14,677 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:14,677 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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 13:07:14,682 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-13 13:07:14,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-13 13:07:14,879 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:14,880 INFO L85 PathProgramCache]: Analyzing trace with hash -930567856, now seen corresponding path program 1 times [2022-12-13 13:07:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:14,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900480752] [2022-12-13 13:07:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:14,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:15,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:15,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:15,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:15,415 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-12-13 13:07:15,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:15,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900480752] [2022-12-13 13:07:15,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900480752] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:15,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215943754] [2022-12-13 13:07:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:15,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:15,416 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:15,416 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:15,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-13 13:07:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:15,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 13:07:15,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:15,593 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 13:07:15,617 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 13:07:15,636 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_1822 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1822))))) is different from true [2022-12-13 13:07:15,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:15,677 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 13:07:15,693 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 13:07:15,699 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1823 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1823) |c_#length|)) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 13:07:15,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:15,730 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 13:07:15,790 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 13:07:15,796 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_1824 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_1824))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2022-12-13 13:07:15,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:15,828 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 13:07:15,849 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-12-13 13:07:15,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:15,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215943754] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:15,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:07:15,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2022-12-13 13:07:15,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093862457] [2022-12-13 13:07:15,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:15,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-12-13 13:07:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:15,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-12-13 13:07:15,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=251, Unknown=3, NotChecked=102, Total=420 [2022-12-13 13:07:15,942 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 13:07:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:16,411 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-12-13 13:07:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:07:16,412 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-12-13 13:07:16,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:16,412 INFO L225 Difference]: With dead ends: 136 [2022-12-13 13:07:16,412 INFO L226 Difference]: Without dead ends: 136 [2022-12-13 13:07:16,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=335, Unknown=3, NotChecked=120, Total=552 [2022-12-13 13:07:16,413 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 519 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:16,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 379 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 515 Invalid, 0 Unknown, 357 Unchecked, 0.4s Time] [2022-12-13 13:07:16,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-12-13 13:07:16,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2022-12-13 13:07:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 113 states have internal predecessors, (120), 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 13:07:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 126 transitions. [2022-12-13 13:07:16,416 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 126 transitions. Word has length 43 [2022-12-13 13:07:16,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:16,416 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 126 transitions. [2022-12-13 13:07:16,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 4.4) internal successors, (66), 17 states have internal predecessors, (66), 5 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 13:07:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 126 transitions. [2022-12-13 13:07:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 13:07:16,417 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:16,417 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 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 13:07:16,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-13 13:07:16,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-13 13:07:16,619 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:16,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883970, now seen corresponding path program 1 times [2022-12-13 13:07:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:16,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99547781] [2022-12-13 13:07:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:16,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:16,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:16,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:16,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:17,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-13 13:07:17,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:17,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99547781] [2022-12-13 13:07:17,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99547781] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:17,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627795995] [2022-12-13 13:07:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:17,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:17,249 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:17,250 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:17,251 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-13 13:07:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:17,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-13 13:07:17,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:17,445 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 13:07:17,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-12-13 13:07:17,711 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_2064 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2064))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))) is different from true [2022-12-13 13:07:17,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:17,734 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 13:07:17,743 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-12-13 13:07:17,744 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 13:07:17,793 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 13:07:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-12-13 13:07:17,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:17,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627795995] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:17,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:07:17,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-12-13 13:07:17,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001594189] [2022-12-13 13:07:17,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:17,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-13 13:07:17,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:17,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-13 13:07:17,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=655, Unknown=19, NotChecked=52, Total=812 [2022-12-13 13:07:17,937 INFO L87 Difference]: Start difference. First operand 118 states and 126 transitions. Second operand has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 13:07:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:18,916 INFO L93 Difference]: Finished difference Result 223 states and 239 transitions. [2022-12-13 13:07:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-13 13:07:18,916 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-12-13 13:07:18,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:18,919 INFO L225 Difference]: With dead ends: 223 [2022-12-13 13:07:18,919 INFO L226 Difference]: Without dead ends: 223 [2022-12-13 13:07:18,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=214, Invalid=1175, Unknown=21, NotChecked=72, Total=1482 [2022-12-13 13:07:18,920 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 1373 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 25 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1373 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 142 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:18,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1373 Valid, 675 Invalid, 1192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1022 Invalid, 3 Unknown, 142 Unchecked, 0.7s Time] [2022-12-13 13:07:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-12-13 13:07:18,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 125. [2022-12-13 13:07:18,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.6506024096385543) internal successors, (137), 120 states have internal predecessors, (137), 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 13:07:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 143 transitions. [2022-12-13 13:07:18,925 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 143 transitions. Word has length 46 [2022-12-13 13:07:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:18,926 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 143 transitions. [2022-12-13 13:07:18,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 2.56) internal successors, (64), 24 states have internal predecessors, (64), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 13:07:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 143 transitions. [2022-12-13 13:07:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-12-13 13:07:18,927 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:18,927 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 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 13:07:18,933 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-13 13:07:19,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 13:07:19,128 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:19,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:19,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883971, now seen corresponding path program 1 times [2022-12-13 13:07:19,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:19,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957845991] [2022-12-13 13:07:19,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:19,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:19,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:19,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:19,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:20,342 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:07:20,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:20,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957845991] [2022-12-13 13:07:20,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957845991] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:20,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991659520] [2022-12-13 13:07:20,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:20,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:20,342 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:20,343 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:20,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-13 13:07:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:20,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-13 13:07:20,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:20,541 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 13:07:20,547 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 13:07:20,945 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 13:07:20,949 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 13:07:21,092 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_2311 (Array Int Int)) (v_ArrVal_2310 (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|) (= 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_2310)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2311)))) is different from true [2022-12-13 13:07:21,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:21,126 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 21 [2022-12-13 13:07:21,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:21,134 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 13:07:21,142 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-12-13 13:07:21,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 15 treesize of output 15 [2022-12-13 13:07:21,146 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 13:07:21,188 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 22 treesize of output 10 [2022-12-13 13:07:21,193 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 13:07:21,206 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-12-13 13:07:21,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:21,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991659520] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:21,472 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:07:21,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2022-12-13 13:07:21,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540405197] [2022-12-13 13:07:21,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:21,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-13 13:07:21,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:21,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-13 13:07:21,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1015, Unknown=1, NotChecked=64, Total=1190 [2022-12-13 13:07:21,473 INFO L87 Difference]: Start difference. First operand 125 states and 143 transitions. Second operand has 31 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 13:07:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:22,937 INFO L93 Difference]: Finished difference Result 204 states and 218 transitions. [2022-12-13 13:07:22,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-13 13:07:22,937 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-12-13 13:07:22,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:22,938 INFO L225 Difference]: With dead ends: 204 [2022-12-13 13:07:22,938 INFO L226 Difference]: Without dead ends: 204 [2022-12-13 13:07:22,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=220, Invalid=1763, Unknown=1, NotChecked=86, Total=2070 [2022-12-13 13:07:22,939 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 518 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 1927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:22,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 1017 Invalid, 1927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1798 Invalid, 0 Unknown, 124 Unchecked, 1.1s Time] [2022-12-13 13:07:22,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-12-13 13:07:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 125. [2022-12-13 13:07:22,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 83 states have (on average 1.6265060240963856) internal successors, (135), 120 states have internal predecessors, (135), 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 13:07:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 141 transitions. [2022-12-13 13:07:22,941 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 141 transitions. Word has length 46 [2022-12-13 13:07:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:22,941 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 141 transitions. [2022-12-13 13:07:22,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.392857142857143) internal successors, (67), 27 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-12-13 13:07:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 141 transitions. [2022-12-13 13:07:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-12-13 13:07:22,942 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:22,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 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 13:07:22,948 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-13 13:07:23,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-13 13:07:23,144 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:23,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:23,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1771238793, now seen corresponding path program 1 times [2022-12-13 13:07:23,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:23,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037137908] [2022-12-13 13:07:23,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:23,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:23,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 13:07:23,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:23,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037137908] [2022-12-13 13:07:23,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037137908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:23,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:23,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:07:23,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266106150] [2022-12-13 13:07:23,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:23,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:07:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:07:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:07:23,239 INFO L87 Difference]: Start difference. First operand 125 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:23,318 INFO L93 Difference]: Finished difference Result 164 states and 176 transitions. [2022-12-13 13:07:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:07:23,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2022-12-13 13:07:23,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:23,319 INFO L225 Difference]: With dead ends: 164 [2022-12-13 13:07:23,319 INFO L226 Difference]: Without dead ends: 164 [2022-12-13 13:07:23,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 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 13:07:23,320 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 77 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:23,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 258 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:07:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-12-13 13:07:23,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 121. [2022-12-13 13:07:23,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 116 states have internal predecessors, (124), 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 13:07:23,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2022-12-13 13:07:23,322 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 47 [2022-12-13 13:07:23,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:23,322 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2022-12-13 13:07:23,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:23,322 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2022-12-13 13:07:23,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 13:07:23,323 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:23,323 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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 13:07:23,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:07:23,323 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:23,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:23,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997608, now seen corresponding path program 1 times [2022-12-13 13:07:23,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:23,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601050830] [2022-12-13 13:07:23,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:23,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:23,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 13:07:23,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:23,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601050830] [2022-12-13 13:07:23,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601050830] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:23,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:23,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:07:23,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396865004] [2022-12-13 13:07:23,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:23,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:07:23,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:23,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:07:23,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:07:23,434 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:23,599 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-12-13 13:07:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:07:23,599 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2022-12-13 13:07:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:23,600 INFO L225 Difference]: With dead ends: 133 [2022-12-13 13:07:23,600 INFO L226 Difference]: Without dead ends: 133 [2022-12-13 13:07:23,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 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 13:07:23,601 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 85 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:23,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 307 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:07:23,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-12-13 13:07:23,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 115. [2022-12-13 13:07:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 79 states have (on average 1.4936708860759493) internal successors, (118), 110 states have internal predecessors, (118), 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 13:07:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2022-12-13 13:07:23,605 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 49 [2022-12-13 13:07:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:23,606 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2022-12-13 13:07:23,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2022-12-13 13:07:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 13:07:23,607 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:23,607 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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 13:07:23,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:07:23,607 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:23,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:23,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997607, now seen corresponding path program 1 times [2022-12-13 13:07:23,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:23,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476959938] [2022-12-13 13:07:23,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:23,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:23,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,718 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 13:07:23,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:23,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476959938] [2022-12-13 13:07:23,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476959938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:23,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:23,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:07:23,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123694784] [2022-12-13 13:07:23,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:23,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:07:23,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:23,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:07:23,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:07:23,720 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:23,821 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2022-12-13 13:07:23,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:07:23,822 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-12-13 13:07:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:23,823 INFO L225 Difference]: With dead ends: 114 [2022-12-13 13:07:23,823 INFO L226 Difference]: Without dead ends: 114 [2022-12-13 13:07:23,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:07:23,824 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 99 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:23,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 277 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:07:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-12-13 13:07:23,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-12-13 13:07:23,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 78 states have (on average 1.4871794871794872) internal successors, (116), 109 states have internal predecessors, (116), 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 13:07:23,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2022-12-13 13:07:23,826 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 49 [2022-12-13 13:07:23,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:23,826 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2022-12-13 13:07:23,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2022-12-13 13:07:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-13 13:07:23,826 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:23,826 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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 13:07:23,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:07:23,827 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:23,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1351857860, now seen corresponding path program 1 times [2022-12-13 13:07:23,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:23,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639680814] [2022-12-13 13:07:23,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:23,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:23,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:23,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 13:07:23,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:23,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639680814] [2022-12-13 13:07:23,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639680814] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:23,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:23,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:07:23,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447302331] [2022-12-13 13:07:23,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:23,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:07:23,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:23,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:07:23,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:07:23,949 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:24,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:24,058 INFO L93 Difference]: Finished difference Result 111 states and 118 transitions. [2022-12-13 13:07:24,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:07:24,059 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-12-13 13:07:24,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:24,060 INFO L225 Difference]: With dead ends: 111 [2022-12-13 13:07:24,060 INFO L226 Difference]: Without dead ends: 111 [2022-12-13 13:07:24,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:07:24,061 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 177 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:24,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 219 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:07:24,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-12-13 13:07:24,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2022-12-13 13:07:24,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 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 13:07:24,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2022-12-13 13:07:24,063 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 49 [2022-12-13 13:07:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:24,063 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2022-12-13 13:07:24,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:07:24,063 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2022-12-13 13:07:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 13:07:24,063 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:24,064 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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 13:07:24,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:07:24,064 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:24,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077693, now seen corresponding path program 1 times [2022-12-13 13:07:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:24,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190391973] [2022-12-13 13:07:24,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:24,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,149 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 13:07:24,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:24,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190391973] [2022-12-13 13:07:24,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190391973] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:24,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:24,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:07:24,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110294235] [2022-12-13 13:07:24,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:24,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:07:24,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:24,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:07:24,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:07:24,151 INFO L87 Difference]: Start difference. First operand 111 states and 118 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:24,303 INFO L93 Difference]: Finished difference Result 169 states and 181 transitions. [2022-12-13 13:07:24,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:07:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-12-13 13:07:24,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:24,304 INFO L225 Difference]: With dead ends: 169 [2022-12-13 13:07:24,305 INFO L226 Difference]: Without dead ends: 169 [2022-12-13 13:07:24,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:07:24,305 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 163 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:24,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 215 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:07:24,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-12-13 13:07:24,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 110. [2022-12-13 13:07:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 105 states have internal predecessors, (111), 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 13:07:24,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2022-12-13 13:07:24,309 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 50 [2022-12-13 13:07:24,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:24,309 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2022-12-13 13:07:24,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-12-13 13:07:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-12-13 13:07:24,309 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:24,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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 13:07:24,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:07:24,310 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:24,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:24,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077694, now seen corresponding path program 1 times [2022-12-13 13:07:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:24,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978775807] [2022-12-13 13:07:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:24,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:24,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,416 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 13:07:24,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:24,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978775807] [2022-12-13 13:07:24,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978775807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:24,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:24,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:07:24,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429502895] [2022-12-13 13:07:24,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:24,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:07:24,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:24,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:07:24,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:07:24,417 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:24,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:24,553 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2022-12-13 13:07:24,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:07:24,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 50 [2022-12-13 13:07:24,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:24,554 INFO L225 Difference]: With dead ends: 109 [2022-12-13 13:07:24,554 INFO L226 Difference]: Without dead ends: 109 [2022-12-13 13:07:24,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:07:24,555 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 82 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:24,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 202 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 13:07:24,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-12-13 13:07:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-12-13 13:07:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 77 states have (on average 1.4285714285714286) internal successors, (110), 104 states have internal predecessors, (110), 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 13:07:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2022-12-13 13:07:24,557 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 50 [2022-12-13 13:07:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:24,557 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2022-12-13 13:07:24,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:24,557 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-12-13 13:07:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 13:07:24,558 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:24,558 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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 13:07:24,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 13:07:24,558 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash -2055329845, now seen corresponding path program 1 times [2022-12-13 13:07:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:24,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075602220] [2022-12-13 13:07:24,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:24,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:24,733 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 13:07:24,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:24,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075602220] [2022-12-13 13:07:24,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075602220] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:07:24,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:07:24,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:07:24,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475960904] [2022-12-13 13:07:24,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:07:24,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:07:24,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:24,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:07:24,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:07:24,734 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:24,916 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-12-13 13:07:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:07:24,916 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 51 [2022-12-13 13:07:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:24,917 INFO L225 Difference]: With dead ends: 103 [2022-12-13 13:07:24,917 INFO L226 Difference]: Without dead ends: 103 [2022-12-13 13:07:24,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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 13:07:24,918 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:24,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 310 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 13:07:24,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-12-13 13:07:24,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-12-13 13:07:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 98 states have internal predecessors, (104), 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 13:07:24,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-12-13 13:07:24,920 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 51 [2022-12-13 13:07:24,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:24,920 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-12-13 13:07:24,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-13 13:07:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-12-13 13:07:24,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 13:07:24,921 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:24,921 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:24,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:07:24,921 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:24,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:24,921 INFO L85 PathProgramCache]: Analyzing trace with hash 512975501, now seen corresponding path program 1 times [2022-12-13 13:07:24,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:24,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338464670] [2022-12-13 13:07:24,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:24,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:25,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:25,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:25,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:26,625 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:07:26,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338464670] [2022-12-13 13:07:26,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338464670] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:26,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122836737] [2022-12-13 13:07:26,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:26,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:26,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:26,627 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:26,627 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-13 13:07:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:26,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 98 conjunts are in the unsatisfiable core [2022-12-13 13:07:26,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:26,827 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 13:07:27,053 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:07:27,053 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 13:07:27,188 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 13:07:27,298 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:07:27,298 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 35 treesize of output 34 [2022-12-13 13:07:27,458 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:07:27,458 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 13:07:27,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:27,521 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 26 [2022-12-13 13:07:27,660 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:07:27,660 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 39 treesize of output 22 [2022-12-13 13:07:27,665 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 13:07:27,860 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3634 (Array Int Int)) (v_ArrVal_3635 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#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_3635)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3634)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2022-12-13 13:07:27,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:27,907 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:07:27,908 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 45 treesize of output 43 [2022-12-13 13:07:27,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:27,915 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 13:07:27,946 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-12-13 13:07:27,946 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 36 treesize of output 52 [2022-12-13 13:07:28,023 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 13:07:28,144 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:07:28,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 25 [2022-12-13 13:07:28,253 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 13:07:28,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:28,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122836737] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:28,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:07:28,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-12-13 13:07:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276965271] [2022-12-13 13:07:28,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:28,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-12-13 13:07:28,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:28,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-12-13 13:07:28,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2083, Unknown=1, NotChecked=92, Total=2352 [2022-12-13 13:07:28,399 INFO L87 Difference]: Start difference. First operand 103 states and 110 transitions. Second operand has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 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 13:07:30,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:30,580 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-12-13 13:07:30,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-13 13:07:30,581 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 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 53 [2022-12-13 13:07:30,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:30,581 INFO L225 Difference]: With dead ends: 121 [2022-12-13 13:07:30,581 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 13:07:30,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=396, Invalid=3267, Unknown=1, NotChecked=118, Total=3782 [2022-12-13 13:07:30,582 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 328 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 126 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:30,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 1219 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1939 Invalid, 0 Unknown, 126 Unchecked, 1.3s Time] [2022-12-13 13:07:30,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 13:07:30,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 102. [2022-12-13 13:07:30,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 97 states have internal predecessors, (103), 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 13:07:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-12-13 13:07:30,584 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 53 [2022-12-13 13:07:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:30,585 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-12-13 13:07:30,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 43 states have (on average 2.0) internal successors, (86), 41 states have internal predecessors, (86), 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 13:07:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-12-13 13:07:30,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-13 13:07:30,585 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:30,585 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:30,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-12-13 13:07:30,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-12-13 13:07:30,786 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:30,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:30,786 INFO L85 PathProgramCache]: Analyzing trace with hash 512975502, now seen corresponding path program 1 times [2022-12-13 13:07:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:30,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272715587] [2022-12-13 13:07:30,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:30,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:31,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:07:33,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:33,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272715587] [2022-12-13 13:07:33,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272715587] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:33,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702518555] [2022-12-13 13:07:33,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:33,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:33,061 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:33,062 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:33,062 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-12-13 13:07:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:33,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 115 conjunts are in the unsatisfiable core [2022-12-13 13:07:33,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:33,306 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 13:07:33,597 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:07:33,597 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 13:07:33,749 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 13:07:33,763 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 13:07:33,863 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:07:33,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 55 [2022-12-13 13:07:33,868 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 33 [2022-12-13 13:07:34,068 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:07:34,068 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 53 treesize of output 50 [2022-12-13 13:07:34,074 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 33 [2022-12-13 13:07:34,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:34,163 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 36 treesize of output 31 [2022-12-13 13:07:34,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:34,168 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 46 treesize of output 37 [2022-12-13 13:07:34,366 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:07:34,366 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 73 treesize of output 40 [2022-12-13 13:07:34,372 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 26 treesize of output 14 [2022-12-13 13:07:34,561 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3937 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_3936 (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|) (= 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_3937)) (= (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_3936) |c_#memory_$Pointer$.offset|))) is different from true [2022-12-13 13:07:34,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:34,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:34,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:34,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 47 [2022-12-13 13:07:34,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:34,607 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:07:34,607 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 79 treesize of output 67 [2022-12-13 13:07:34,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:34,611 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 32 treesize of output 27 [2022-12-13 13:07:34,623 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 13:07:34,624 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 13:07:34,864 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-12-13 13:07:34,864 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 81 treesize of output 47 [2022-12-13 13:07:34,870 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 13:07:34,871 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 1 case distinctions, treesize of input 37 treesize of output 23 [2022-12-13 13:07:34,970 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-13 13:07:34,971 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:07:35,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702518555] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:35,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:07:35,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-12-13 13:07:35,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23793458] [2022-12-13 13:07:35,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:07:35,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-13 13:07:35,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:07:35,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-13 13:07:35,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3013, Unknown=1, NotChecked=110, Total=3306 [2022-12-13 13:07:35,443 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 52 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 45 states have internal predecessors, (90), 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 13:07:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:07:38,727 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-12-13 13:07:38,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-12-13 13:07:38,727 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 45 states have internal predecessors, (90), 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 53 [2022-12-13 13:07:38,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:07:38,728 INFO L225 Difference]: With dead ends: 101 [2022-12-13 13:07:38,728 INFO L226 Difference]: Without dead ends: 101 [2022-12-13 13:07:38,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=421, Invalid=4838, Unknown=1, NotChecked=142, Total=5402 [2022-12-13 13:07:38,729 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 350 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 2108 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 1245 SdHoareTripleChecker+Invalid, 2245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 105 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:07:38,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 1245 Invalid, 2245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2108 Invalid, 0 Unknown, 105 Unchecked, 1.4s Time] [2022-12-13 13:07:38,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-13 13:07:38,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-12-13 13:07:38,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 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 13:07:38,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-12-13 13:07:38,731 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 53 [2022-12-13 13:07:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:07:38,731 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-12-13 13:07:38,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 47 states have (on average 1.9148936170212767) internal successors, (90), 45 states have internal predecessors, (90), 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 13:07:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-12-13 13:07:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 13:07:38,731 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:07:38,731 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:07:38,736 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-12-13 13:07:38,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:38,933 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:07:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:07:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash 167962770, now seen corresponding path program 1 times [2022-12-13 13:07:38,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:07:38,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216020217] [2022-12-13 13:07:38,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:38,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:07:38,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:40,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:07:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:07:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:07:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:41,133 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:07:41,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:07:41,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216020217] [2022-12-13 13:07:41,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216020217] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:07:41,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674763821] [2022-12-13 13:07:41,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:07:41,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:07:41,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:07:41,134 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:07:41,135 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-12-13 13:07:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:07:41,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-13 13:07:41,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:07:41,330 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 13:07:41,336 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 13:07:41,451 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:07:41,452 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 13:07:41,562 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 13:07:41,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:41,709 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:07:41,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 22 treesize of output 29 [2022-12-13 13:07:41,867 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 11 treesize of output 7 [2022-12-13 13:07:41,991 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:07:41,991 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 43 treesize of output 40 [2022-12-13 13:07:42,187 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:07:42,187 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 36 treesize of output 35 [2022-12-13 13:07:42,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:42,286 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 39 treesize of output 30 [2022-12-13 13:07:42,477 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:07:42,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-12-13 13:07:42,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:42,482 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 13:07:42,485 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 13:07:56,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:56,341 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 13:07:56,341 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 68 treesize of output 51 [2022-12-13 13:07:56,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:56,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:56,557 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 13:07:56,557 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 13:07:56,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:07:56,583 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 16 treesize of output 11 [2022-12-13 13:07:59,146 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:08:05,816 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:08:05,816 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 2 case distinctions, treesize of input 192 treesize of output 131 [2022-12-13 13:08:05,858 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 116 treesize of output 100 [2022-12-13 13:08:07,102 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:08:07,103 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 117 treesize of output 103 [2022-12-13 13:08:07,395 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:08:07,396 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 117 treesize of output 103 [2022-12-13 13:08:08,089 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 13:08:08,753 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 13:08:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:08:08,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:08:34,314 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-12-13 13:08:34,315 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 29 treesize of output 28 [2022-12-13 13:08:50,625 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4246 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base_33| Int) (v_ArrVal_4258 (Array Int Int)) (v_ArrVal_4248 (Array Int Int)) (v_ArrVal_4259 (Array Int Int)) (v_ArrVal_4249 (Array Int Int)) (|v_node_create_~temp~0#1.base_64| Int)) (or (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_64| v_ArrVal_4258))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (= .cse0 (select (select (store (store (store .cse1 .cse0 v_ArrVal_4246) |v_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base_33| v_ArrVal_4248) (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_64| v_ArrVal_4259) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) v_ArrVal_4249) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (< |v_node_create_~temp~0#1.base_64| |v_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base_33|) (not (< |v_node_create_~temp~0#1.base_64| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_64|) 0)))) is different from false [2022-12-13 13:08:50,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674763821] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:08:50,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:08:50,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 61 [2022-12-13 13:08:50,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156258670] [2022-12-13 13:08:50,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:08:50,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-12-13 13:08:50,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:08:50,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-12-13 13:08:50,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=4543, Unknown=178, NotChecked=138, Total=5112 [2022-12-13 13:08:50,634 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 13:09:32,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:09:32,663 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2022-12-13 13:09:32,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-12-13 13:09:32,665 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-12-13 13:09:32,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:09:32,666 INFO L225 Difference]: With dead ends: 225 [2022-12-13 13:09:32,666 INFO L226 Difference]: Without dead ends: 225 [2022-12-13 13:09:32,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1785 ImplicationChecksByTransitivity, 90.2s TimeCoverageRelationStatistics Valid=683, Invalid=7515, Unknown=178, NotChecked=180, Total=8556 [2022-12-13 13:09:32,668 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 947 mSDsluCounter, 1283 mSDsCounter, 0 mSdLazyCounter, 2418 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 2418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.1s IncrementalHoareTripleChecker+Time [2022-12-13 13:09:32,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 1323 Invalid, 2489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 2418 Invalid, 0 Unknown, 0 Unchecked, 17.1s Time] [2022-12-13 13:09:32,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-12-13 13:09:32,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 104. [2022-12-13 13:09:32,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 81 states have (on average 1.308641975308642) internal successors, (106), 99 states have internal predecessors, (106), 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 13:09:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2022-12-13 13:09:32,672 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 57 [2022-12-13 13:09:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:09:32,672 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2022-12-13 13:09:32,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 53 states have internal predecessors, (94), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 13:09:32,672 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2022-12-13 13:09:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-13 13:09:32,673 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:09:32,673 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:32,681 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-12-13 13:09:32,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-12-13 13:09:32,874 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:09:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:09:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash 167962771, now seen corresponding path program 1 times [2022-12-13 13:09:32,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:09:32,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379145727] [2022-12-13 13:09:32,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:32,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:09:32,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:41,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:09:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:42,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:09:42,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:44,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:09:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:09:48,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:09:48,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379145727] [2022-12-13 13:09:48,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379145727] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:09:48,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109826135] [2022-12-13 13:09:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:09:48,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:09:48,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:09:48,490 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:09:48,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-12-13 13:09:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:09:48,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 127 conjunts are in the unsatisfiable core [2022-12-13 13:09:48,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:09:48,719 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 13:09:48,772 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 13:09:50,359 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:09:50,359 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 13:09:51,617 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 13:09:53,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:09:53,790 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:09:53,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 22 treesize of output 29 [2022-12-13 13:09:55,468 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 11 treesize of output 7 [2022-12-13 13:09:56,475 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:09:56,475 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 43 treesize of output 40 [2022-12-13 13:09:58,314 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:09:58,315 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 36 treesize of output 35 [2022-12-13 13:09:59,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:09:59,120 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 39 treesize of output 30 [2022-12-13 13:10:00,921 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:10:00,921 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 67 treesize of output 30 [2022-12-13 13:10:00,936 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 13:10:00,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:10:00,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 13:10:00,969 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 13:11:09,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:11:09,166 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-12-13 13:11:09,167 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 77 treesize of output 58 [2022-12-13 13:11:09,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:11:09,224 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 13:11:09,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:11:09,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:11:09,397 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 13:11:09,397 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 13:11:09,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:11:09,424 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 16 treesize of output 11 [2022-12-13 13:11:20,149 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:11:20,150 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 2 case distinctions, treesize of input 206 treesize of output 143 [2022-12-13 13:11:20,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:11:20,207 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 27 treesize of output 27 [2022-12-13 13:11:20,234 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 100 [2022-12-13 13:11:21,650 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-13 13:11:21,650 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 14 treesize of output 20 [2022-12-13 13:11:21,678 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 13:11:21,783 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:11:21,784 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 117 treesize of output 103 [2022-12-13 13:11:22,933 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:11:22,933 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 117 treesize of output 103 [2022-12-13 13:11:22,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:11:22,991 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 13:11:23,821 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 13:11:23,849 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 13:11:24,656 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 13:11:24,685 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 13:11:26,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:11:26,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:11:28,314 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4562 (Array Int Int)) (v_ArrVal_4563 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4563) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4562 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4562) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-12-13 13:11:51,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109826135] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:11:51,088 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:11:51,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 65 [2022-12-13 13:11:51,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167525269] [2022-12-13 13:11:51,088 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:11:51,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-12-13 13:11:51,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:11:51,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-12-13 13:11:51,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=5680, Unknown=47, NotChecked=152, Total=6162 [2022-12-13 13:11:51,091 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 66 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 57 states have internal predecessors, (96), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 13:11:53,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:02,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:08,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.59s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:11,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:15,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:19,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:23,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:30,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:35,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:41,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:46,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:51,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:12:57,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:02,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:04,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:06,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:11,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:15,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:18,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:21,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:24,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:26,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:30,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:35,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:41,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:45,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:48,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:51,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:53,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:13:57,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:00,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:02,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:05,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:07,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:10,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:13,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:15,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:18,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:21,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:23,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:28,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:30,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:35,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:37,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:40,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:42,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:45,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:48,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:50,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:54,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:56,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:14:58,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:01,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:05,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:08,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:12,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:14,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:17,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:21,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:23,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:25,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:28,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:30,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:32,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-13 13:15:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:15:33,421 INFO L93 Difference]: Finished difference Result 223 states and 240 transitions. [2022-12-13 13:15:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 13:15:33,422 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 57 states have internal predecessors, (96), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 57 [2022-12-13 13:15:33,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:15:33,423 INFO L225 Difference]: With dead ends: 223 [2022-12-13 13:15:33,423 INFO L226 Difference]: Without dead ends: 223 [2022-12-13 13:15:33,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 99 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 158.6s TimeCoverageRelationStatistics Valid=728, Invalid=9129, Unknown=47, NotChecked=196, Total=10100 [2022-12-13 13:15:33,425 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 965 mSDsluCounter, 1307 mSDsCounter, 0 mSdLazyCounter, 2853 mSolverCounterSat, 81 mSolverCounterUnsat, 64 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 177.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2853 IncrementalHoareTripleChecker+Invalid, 64 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 187.5s IncrementalHoareTripleChecker+Time [2022-12-13 13:15:33,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1344 Invalid, 2998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2853 Invalid, 64 Unknown, 0 Unchecked, 187.5s Time] [2022-12-13 13:15:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-12-13 13:15:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 106. [2022-12-13 13:15:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.3012048192771084) internal successors, (108), 101 states have internal predecessors, (108), 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 13:15:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-12-13 13:15:33,429 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 57 [2022-12-13 13:15:33,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:15:33,429 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-12-13 13:15:33,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 62 states have (on average 1.5483870967741935) internal successors, (96), 57 states have internal predecessors, (96), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 13:15:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-12-13 13:15:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 13:15:33,429 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:15:33,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:15:33,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-12-13 13:15:33,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-12-13 13:15:33,631 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:15:33,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:33,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560249, now seen corresponding path program 1 times [2022-12-13 13:15:33,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:33,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47976120] [2022-12-13 13:15:33,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:33,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:15:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:34,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:15:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:34,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:15:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 13:15:34,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47976120] [2022-12-13 13:15:34,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47976120] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:15:34,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [917217499] [2022-12-13 13:15:34,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:34,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:34,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:15:34,314 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:15:34,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-12-13 13:15:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:34,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 13:15:34,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:15:34,945 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 13:15:36,295 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 13:15:36,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-12-13 13:15:36,856 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 13:15:36,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:15:36,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [917217499] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:15:36,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-13 13:15:36,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 17 [2022-12-13 13:15:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266795885] [2022-12-13 13:15:36,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:15:36,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:15:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:15:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-12-13 13:15:36,858 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:15:40,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:15:40,661 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-12-13 13:15:40,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 13:15:40,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 58 [2022-12-13 13:15:40,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:15:40,664 INFO L225 Difference]: With dead ends: 167 [2022-12-13 13:15:40,664 INFO L226 Difference]: Without dead ends: 167 [2022-12-13 13:15:40,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-12-13 13:15:40,665 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 206 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:15:40,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 544 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-12-13 13:15:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-12-13 13:15:40,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 107. [2022-12-13 13:15:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 102 states have internal predecessors, (110), 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 13:15:40,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-12-13 13:15:40,668 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2022-12-13 13:15:40,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:15:40,668 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-12-13 13:15:40,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 13:15:40,668 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-12-13 13:15:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-12-13 13:15:40,669 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:15:40,669 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:15:40,675 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-12-13 13:15:40,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-12-13 13:15:40,870 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:15:40,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:40,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560248, now seen corresponding path program 1 times [2022-12-13 13:15:40,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:40,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395643262] [2022-12-13 13:15:40,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:40,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:41,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:15:41,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:41,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:15:41,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:41,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:15:41,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 13:15:41,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:15:41,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395643262] [2022-12-13 13:15:41,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395643262] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:15:41,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100006943] [2022-12-13 13:15:41,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:41,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:41,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:15:41,670 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:15:41,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-12-13 13:15:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:15:41,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 26 conjunts are in the unsatisfiable core [2022-12-13 13:15:41,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:15:41,924 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 13:15:42,138 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5117 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5117))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-12-13 13:15:42,319 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 13:15:42,424 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5118 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5118))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-12-13 13:15:42,610 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 13:15:42,823 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_5119 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5119))))) is different from true [2022-12-13 13:15:43,016 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 13:15:43,073 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 13:15:43,283 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 13:15:43,283 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 13:15:43,326 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-12-13 13:15:43,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:15:46,760 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-13 13:15:46,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100006943] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 13:15:46,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 13:15:46,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2022-12-13 13:15:46,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386662963] [2022-12-13 13:15:46,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 13:15:46,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-13 13:15:46,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:15:46,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-13 13:15:46,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-12-13 13:15:46,762 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 15 states have internal predecessors, (88), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 13:15:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:15:48,656 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-12-13 13:15:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:15:48,657 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 15 states have internal predecessors, (88), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2022-12-13 13:15:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:15:48,658 INFO L225 Difference]: With dead ends: 82 [2022-12-13 13:15:48,658 INFO L226 Difference]: Without dead ends: 82 [2022-12-13 13:15:48,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=104, Invalid=247, Unknown=3, NotChecked=108, Total=462 [2022-12-13 13:15:48,658 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 266 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-12-13 13:15:48,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 246 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 209 Invalid, 0 Unknown, 231 Unchecked, 1.4s Time] [2022-12-13 13:15:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-12-13 13:15:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-12-13 13:15:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.3015873015873016) internal successors, (82), 77 states have internal predecessors, (82), 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 13:15:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-12-13 13:15:48,661 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 58 [2022-12-13 13:15:48,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:15:48,661 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-12-13 13:15:48,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.888888888888889) internal successors, (88), 15 states have internal predecessors, (88), 2 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 13:15:48,662 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-12-13 13:15:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-12-13 13:15:48,662 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:15:48,662 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:15:48,669 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-12-13 13:15:48,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:15:48,863 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:15:48,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:15:48,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1796531691, now seen corresponding path program 1 times [2022-12-13 13:15:48,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:15:48,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428555042] [2022-12-13 13:15:48,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:15:48,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:15:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:16:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:01,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:16:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:16:03,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:06,187 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:16:06,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:16:06,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428555042] [2022-12-13 13:16:06,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428555042] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:16:06,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183339852] [2022-12-13 13:16:06,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:16:06,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:16:06,188 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:16:06,189 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:16:06,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-12-13 13:16:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:16:06,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 159 conjunts are in the unsatisfiable core [2022-12-13 13:16:06,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:16:06,499 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 13:16:07,098 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 13:16:08,918 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:16:08,919 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 13:16:10,388 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 13:16:11,321 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 13:16:12,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:12,890 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:16:12,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 22 treesize of output 29 [2022-12-13 13:16:14,660 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 11 treesize of output 7 [2022-12-13 13:16:14,750 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 19 treesize of output 18 [2022-12-13 13:16:15,880 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:16:15,880 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 53 treesize of output 48 [2022-12-13 13:16:15,940 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 18 treesize of output 20 [2022-12-13 13:16:18,017 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:16:18,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 43 [2022-12-13 13:16:18,037 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 18 treesize of output 20 [2022-12-13 13:16:19,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:19,019 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 13:16:19,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:19,119 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 39 treesize of output 30 [2022-12-13 13:16:21,058 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:16:21,058 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 69 treesize of output 32 [2022-12-13 13:16:21,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:21,084 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 13:16:21,099 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 13:16:21,113 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 13:16:25,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:25,923 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:16:25,923 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 77 treesize of output 65 [2022-12-13 13:16:26,077 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-12-13 13:16:26,077 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 18 treesize of output 28 [2022-12-13 13:16:26,097 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 13:16:26,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:26,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:26,326 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 13:16:26,327 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 13:16:26,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:26,418 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 14 treesize of output 16 [2022-12-13 13:16:34,810 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:16:34,811 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 2 case distinctions, treesize of input 127 treesize of output 94 [2022-12-13 13:16:34,849 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 35 treesize of output 30 [2022-12-13 13:16:34,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:34,891 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 27 treesize of output 27 [2022-12-13 13:16:34,910 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-12-13 13:16:35,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:35,994 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 43 treesize of output 39 [2022-12-13 13:16:36,030 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 13:16:36,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:36,184 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 14 treesize of output 16 [2022-12-13 13:16:36,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:36,248 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 43 treesize of output 39 [2022-12-13 13:16:36,285 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 13:16:36,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:16:36,312 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 14 treesize of output 16 [2022-12-13 13:16:37,265 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 33 [2022-12-13 13:16:37,294 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 18 treesize of output 20 [2022-12-13 13:16:37,325 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 13:16:38,299 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 13:16:38,318 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 13:16:39,852 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 13:16:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:16:40,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:16:41,970 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5445) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-12-13 13:16:42,039 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5444) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5445) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5442) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5443) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-12-13 13:16:44,088 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5438 Int) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| v_ArrVal_5438)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5444) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5445) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5436) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5442) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5437) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5443) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-12-13 13:17:33,052 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5438 Int) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))) (select (select (store (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) .cse1 v_ArrVal_5438)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5444) .cse2 v_ArrVal_5445) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_5436) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5442) .cse2 v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_5437) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5443) .cse2 v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) is different from false [2022-12-13 13:17:33,724 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5438 Int) (v_ArrVal_5460 (Array Int Int)) (v_ArrVal_5462 (Array Int Int)) (v_ArrVal_5461 (Array Int Int)) (v_ArrVal_5442 (Array Int Int)) (v_ArrVal_5444 (Array Int Int)) (v_ArrVal_5443 (Array Int Int)) (v_ArrVal_5446 (Array Int Int)) (v_ArrVal_5445 (Array Int Int)) (v_ArrVal_5437 (Array Int Int)) (v_ArrVal_5436 (Array Int Int)) (v_ArrVal_5447 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| Int)) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5462)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5461))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) (.cse2 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select (select .cse4 .cse1) .cse2))) (select (select (store (store (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5460))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_5438))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5444) .cse3 v_ArrVal_5445) (select (select (store (store (store .cse4 .cse1 v_ArrVal_5436) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5442) .cse3 v_ArrVal_5447) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store .cse5 .cse1 v_ArrVal_5437) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5443) .cse3 v_ArrVal_5446) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31|))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| |c_#StackHeapBarrier|)))) is different from false [2022-12-13 13:17:33,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183339852] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:17:33,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:17:33,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 72 [2022-12-13 13:17:33,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640779490] [2022-12-13 13:17:33,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:17:33,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-12-13 13:17:33,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:17:33,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-12-13 13:17:33,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5728, Unknown=175, NotChecked=790, Total=6972 [2022-12-13 13:17:33,735 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 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 13:18:29,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:18:29,084 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-12-13 13:18:29,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 13:18:29,086 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 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 59 [2022-12-13 13:18:29,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:18:29,087 INFO L225 Difference]: With dead ends: 101 [2022-12-13 13:18:29,087 INFO L226 Difference]: Without dead ends: 101 [2022-12-13 13:18:29,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1894 ImplicationChecksByTransitivity, 126.9s TimeCoverageRelationStatistics Valid=740, Invalid=9610, Unknown=176, NotChecked=1030, Total=11556 [2022-12-13 13:18:29,090 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 820 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 2428 mSolverCounterSat, 61 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 2428 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.6s IncrementalHoareTripleChecker+Time [2022-12-13 13:18:29,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1201 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 2428 Invalid, 2 Unknown, 0 Unchecked, 18.6s Time] [2022-12-13 13:18:29,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-12-13 13:18:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2022-12-13 13:18:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 63 states have (on average 1.2857142857142858) internal successors, (81), 77 states have internal predecessors, (81), 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 13:18:29,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-12-13 13:18:29,093 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 59 [2022-12-13 13:18:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:18:29,094 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-12-13 13:18:29,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 68 states have (on average 1.5294117647058822) internal successors, (104), 63 states have internal predecessors, (104), 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 13:18:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-12-13 13:18:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 13:18:29,094 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:18:29,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:18:29,102 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-12-13 13:18:29,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:18:29,295 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:18:29,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:18:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535007, now seen corresponding path program 1 times [2022-12-13 13:18:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:18:29,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764278874] [2022-12-13 13:18:29,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:18:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:18:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:18:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:18:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:18:40,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:18:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:18:42,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:18:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:18:45,231 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:18:45,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:18:45,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764278874] [2022-12-13 13:18:45,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764278874] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:18:45,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111251362] [2022-12-13 13:18:45,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:18:45,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:18:45,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:18:45,233 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:18:45,234 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-12-13 13:18:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:18:45,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 135 conjunts are in the unsatisfiable core [2022-12-13 13:18:45,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:18:45,529 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 13:18:45,585 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 13:18:47,430 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:18:47,430 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 13:18:48,856 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 13:18:50,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:18:50,633 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:18:50,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 22 treesize of output 29 [2022-12-13 13:18:52,348 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 11 treesize of output 7 [2022-12-13 13:18:53,505 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:18:53,506 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 43 treesize of output 40 [2022-12-13 13:18:55,721 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:18:55,721 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 36 treesize of output 35 [2022-12-13 13:18:56,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:18:56,614 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 39 treesize of output 30 [2022-12-13 13:18:58,783 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:18:58,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-12-13 13:18:58,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:18:58,812 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 13:18:58,834 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 13:19:03,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:19:03,510 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:19:03,511 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 66 treesize of output 56 [2022-12-13 13:19:03,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:19:03,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:19:03,853 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-12-13 13:19:03,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 65 [2022-12-13 13:19:03,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:19:03,969 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 14 treesize of output 16 [2022-12-13 13:19:12,241 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-12-13 13:19:12,242 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 128 treesize of output 72 [2022-12-13 13:19:12,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:19:12,323 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 33 treesize of output 33 [2022-12-13 13:19:13,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:19:13,470 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 14 treesize of output 16 [2022-12-13 13:19:13,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:19:13,650 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:19:13,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 52 [2022-12-13 13:19:13,942 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 13:19:13,942 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 82 [2022-12-13 13:19:14,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:19:14,081 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 22 treesize of output 24 [2022-12-13 13:19:15,148 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:19:15,148 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 87 treesize of output 69 [2022-12-13 13:19:15,225 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 14 treesize of output 16 [2022-12-13 13:19:16,407 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 13:19:18,597 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:19:18,597 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 92 treesize of output 39 [2022-12-13 13:19:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:19:20,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:19:20,906 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5767))) (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_dll_circular_insert_~last~1#1.base| v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-12-13 13:19:20,958 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-12-13 13:19:21,030 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-12-13 13:19:21,111 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base|) |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-12-13 13:19:23,334 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) .cse2 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) .cse2 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2022-12-13 13:19:23,387 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset|))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5764) .cse2 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_#t~mem10#1.base| v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5765) .cse2 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2022-12-13 13:19:25,892 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1)) (.cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (select (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse2 .cse3 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5764) .cse4 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_5761) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_5765) .cse4 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-12-13 13:19:26,578 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5761 (Array Int Int)) (v_ArrVal_5765 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| Int) (v_ArrVal_5764 (Array Int Int)) (v_ArrVal_5778 (Array Int Int)) (v_ArrVal_5767 (Array Int Int)) (v_ArrVal_5777 (Array Int Int)) (v_ArrVal_5766 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| 1) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5777))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5778)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse3 (select .cse1 .cse2)) (.cse4 (select (select .cse6 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse5 (select .cse3 .cse4))) (select (let ((.cse0 (store (store (store .cse1 .cse2 (store .cse3 .cse4 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5764) .cse5 v_ArrVal_5767))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store .cse6 .cse2 v_ArrVal_5761) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5765) .cse5 v_ArrVal_5766) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) 1))) is different from false [2022-12-13 13:19:26,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111251362] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:19:26,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:19:26,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 70 [2022-12-13 13:19:26,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844564436] [2022-12-13 13:19:26,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:19:26,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-12-13 13:19:26,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:19:26,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-12-13 13:19:26,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=4913, Unknown=107, NotChecked=1192, Total=6480 [2022-12-13 13:19:26,590 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 71 states, 67 states have (on average 1.671641791044776) internal successors, (112), 62 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 13:20:11,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 13:20:11,241 INFO L93 Difference]: Finished difference Result 139 states and 148 transitions. [2022-12-13 13:20:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-12-13 13:20:11,242 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 67 states have (on average 1.671641791044776) internal successors, (112), 62 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 63 [2022-12-13 13:20:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 13:20:11,243 INFO L225 Difference]: With dead ends: 139 [2022-12-13 13:20:11,243 INFO L226 Difference]: Without dead ends: 139 [2022-12-13 13:20:11,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 69.2s TimeCoverageRelationStatistics Valid=679, Invalid=7614, Unknown=111, NotChecked=1496, Total=9900 [2022-12-13 13:20:11,245 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 1297 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 64 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1297 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 2333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-12-13 13:20:11,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1297 Valid, 940 Invalid, 2333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2267 Invalid, 2 Unknown, 0 Unchecked, 18.0s Time] [2022-12-13 13:20:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-12-13 13:20:11,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 86. [2022-12-13 13:20:11,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 81 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 13:20:11,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-12-13 13:20:11,247 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 63 [2022-12-13 13:20:11,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 13:20:11,248 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-12-13 13:20:11,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 67 states have (on average 1.671641791044776) internal successors, (112), 62 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-12-13 13:20:11,248 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-12-13 13:20:11,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-12-13 13:20:11,248 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 13:20:11,248 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:20:11,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-12-13 13:20:11,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:20:11,450 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-12-13 13:20:11,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:11,451 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535006, now seen corresponding path program 1 times [2022-12-13 13:20:11,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:11,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289542523] [2022-12-13 13:20:11,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:11,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 13:20:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:24,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-12-13 13:20:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:25,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-12-13 13:20:25,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-13 13:20:31,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:31,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289542523] [2022-12-13 13:20:31,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289542523] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:20:31,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949988452] [2022-12-13 13:20:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:31,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 13:20:31,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:20:31,166 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 13:20:31,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1f7f206e-094a-4a50-9ed2-98abcec285e0/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-12-13 13:20:31,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:31,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 144 conjunts are in the unsatisfiable core [2022-12-13 13:20:31,487 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:20:31,509 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 13:20:31,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-12-13 13:20:33,429 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:20:33,430 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 13:20:34,830 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 13:20:36,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:36,561 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 13:20:36,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 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 22 treesize of output 29 [2022-12-13 13:20:38,295 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 11 treesize of output 7 [2022-12-13 13:20:39,370 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:20:39,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 43 treesize of output 40 [2022-12-13 13:20:41,462 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 13:20:41,462 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 36 treesize of output 35 [2022-12-13 13:20:42,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:42,325 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 39 treesize of output 30 [2022-12-13 13:20:44,160 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-13 13:20:44,160 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-12-13 13:20:44,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:44,185 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 13:20:44,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-13 13:20:48,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:48,846 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 13:20:48,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:48,956 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:20:48,957 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 66 treesize of output 56 [2022-12-13 13:20:49,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:49,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:49,200 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-12-13 13:20:49,200 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 13:20:57,052 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-12-13 13:20:57,053 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 71 [2022-12-13 13:20:57,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:57,096 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-12-13 13:20:58,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:58,261 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:20:58,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 54 [2022-12-13 13:20:58,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:58,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:58,327 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 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 13:20:58,623 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-12-13 13:20:58,623 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 121 treesize of output 92 [2022-12-13 13:20:58,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:58,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:58,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 55 [2022-12-13 13:20:59,828 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-13 13:20:59,829 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 99 treesize of output 79 [2022-12-13 13:20:59,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:20:59,891 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 48 treesize of output 47 [2022-12-13 13:21:03,441 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-12-13 13:21:03,441 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 103 treesize of output 53 [2022-12-13 13:21:03,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:21:03,507 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-13 13:21:03,508 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 1 case distinctions, treesize of input 37 treesize of output 23 [2022-12-13 13:21:05,260 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-13 13:21:05,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 13:21:09,878 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6083 (Array Int Int)) (v_ArrVal_6082 (Array Int Int))) (<= 0 (+ (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6082))) (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6083) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 8))) (forall ((v_ArrVal_6083 (Array Int Int)) (v_ArrVal_6082 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6082)) (.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6083))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse1 .cse2) .cse3) 12) (select |c_#length| (select (select .cse4 .cse2) .cse3))))))) is different from false [2022-12-13 13:21:24,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 13:21:24,172 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 633 treesize of output 637 [2022-12-13 13:21:27,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949988452] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 13:21:27,574 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-13 13:21:27,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 71 [2022-12-13 13:21:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177007563] [2022-12-13 13:21:27,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-13 13:21:27,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-12-13 13:21:27,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:27,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-12-13 13:21:27,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=7013, Unknown=24, NotChecked=168, Total=7482 [2022-12-13 13:21:27,576 INFO L87 Difference]: Start difference. First operand 86 states and 93 transitions. Second operand has 72 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 63 states have internal predecessors, (112), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6)