./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 e04fb08f 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_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 11:51:35,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:51:35,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:51:35,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:51:35,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:51:35,951 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:51:35,955 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:51:35,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:51:35,962 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:51:35,964 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:51:35,965 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:51:35,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:51:35,970 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:51:35,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:51:35,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:51:35,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:51:35,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:51:35,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:51:35,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:51:35,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:51:35,996 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:51:35,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:51:35,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:51:36,001 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:51:36,008 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:51:36,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:51:36,013 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:51:36,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:51:36,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:51:36,017 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:51:36,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:51:36,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:51:36,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:51:36,023 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:51:36,026 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:51:36,026 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:51:36,027 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:51:36,027 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:51:36,028 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:51:36,029 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:51:36,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:51:36,031 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-16 11:51:36,074 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:51:36,075 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:51:36,075 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:51:36,076 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:51:36,076 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:51:36,077 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:51:36,077 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:51:36,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:51:36,078 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:51:36,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:51:36,080 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:51:36,080 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:51:36,080 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:51:36,080 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:51:36,081 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:51:36,081 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-16 11:51:36,081 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-16 11:51:36,081 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-16 11:51:36,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:51:36,082 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:51:36,082 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:51:36,082 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:51:36,083 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:51:36,083 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:51:36,083 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:51:36,083 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:51:36,084 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:51:36,084 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:51:36,084 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:51:36,084 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:51:36,085 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/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_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8 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-11-16 11:51:36,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:51:36,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:51:36,446 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:51:36,447 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:51:36,448 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:51:36,450 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-16 11:51:36,543 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/data/011bf1ea3/d67d94199b7d4fdfa2ecc3f1e2900040/FLAG47ba4c574 [2022-11-16 11:51:37,305 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:51:37,306 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/sv-benchmarks/c/list-simple/dll2c_insert_equal.i [2022-11-16 11:51:37,325 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/data/011bf1ea3/d67d94199b7d4fdfa2ecc3f1e2900040/FLAG47ba4c574 [2022-11-16 11:51:37,554 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/data/011bf1ea3/d67d94199b7d4fdfa2ecc3f1e2900040 [2022-11-16 11:51:37,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:51:37,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:51:37,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:51:37,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:51:37,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:51:37,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47701b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:37, skipping insertion in model container [2022-11-16 11:51:37,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:51:37" (1/1) ... [2022-11-16 11:51:37,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:51:37,653 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:51:38,064 WARN L229 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_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-16 11:51:38,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:51:38,076 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:51:38,124 WARN L229 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_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/sv-benchmarks/c/list-simple/dll2c_insert_equal.i[24877,24890] [2022-11-16 11:51:38,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:51:38,159 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:51:38,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38 WrapperNode [2022-11-16 11:51:38,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:51:38,163 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:51:38,163 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:51:38,163 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:51:38,172 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,193 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,230 INFO L138 Inliner]: procedures = 127, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 160 [2022-11-16 11:51:38,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:51:38,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:51:38,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:51:38,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:51:38,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,256 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,263 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,268 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:51:38,269 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:51:38,269 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:51:38,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:51:38,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (1/1) ... [2022-11-16 11:51:38,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:51:38,306 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:38,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:51:38,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:51:38,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 11:51:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 11:51:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-16 11:51:38,399 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-16 11:51:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 11:51:38,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:51:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 11:51:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 11:51:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 11:51:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 11:51:38,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 11:51:38,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:51:38,401 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:51:38,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:51:38,623 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:51:38,640 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:51:39,425 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:51:39,435 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:51:39,435 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-16 11:51:39,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:51:39 BoogieIcfgContainer [2022-11-16 11:51:39,439 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:51:39,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:51:39,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:51:39,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:51:39,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:51:37" (1/3) ... [2022-11-16 11:51:39,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22935d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:51:39, skipping insertion in model container [2022-11-16 11:51:39,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:51:38" (2/3) ... [2022-11-16 11:51:39,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22935d49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:51:39, skipping insertion in model container [2022-11-16 11:51:39,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:51:39" (3/3) ... [2022-11-16 11:51:39,450 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.i [2022-11-16 11:51:39,473 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:51:39,474 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-16 11:51:39,561 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:51:39,569 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24f0f467, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:51:39,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-16 11:51:39,576 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-11-16 11:51:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:51:39,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:39,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:51:39,589 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-11-16 11:51:39,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:39,599 INFO L85 PathProgramCache]: Analyzing trace with hash 896534515, now seen corresponding path program 1 times [2022-11-16 11:51:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:39,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391436816] [2022-11-16 11:51:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:39,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:39,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:39,980 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391436816] [2022-11-16 11:51:39,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391436816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:39,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:39,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:51:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448447406] [2022-11-16 11:51:39,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:39,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:51:39,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:40,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:51:40,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:51:40,064 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-11-16 11:51:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:40,338 INFO L93 Difference]: Finished difference Result 151 states and 162 transitions. [2022-11-16 11:51:40,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:51:40,341 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-11-16 11:51:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:40,350 INFO L225 Difference]: With dead ends: 151 [2022-11-16 11:51:40,350 INFO L226 Difference]: Without dead ends: 148 [2022-11-16 11:51:40,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:51:40,356 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:40,357 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.2s Time] [2022-11-16 11:51:40,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-16 11:51:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-16 11:51:40,408 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-11-16 11:51:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 158 transitions. [2022-11-16 11:51:40,413 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 158 transitions. Word has length 6 [2022-11-16 11:51:40,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:40,414 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 158 transitions. [2022-11-16 11:51:40,414 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-11-16 11:51:40,414 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 158 transitions. [2022-11-16 11:51:40,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-16 11:51:40,416 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:40,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-16 11:51:40,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:51:40,417 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-11-16 11:51:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash 896534514, now seen corresponding path program 1 times [2022-11-16 11:51:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:40,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488419411] [2022-11-16 11:51:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:40,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:40,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:40,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488419411] [2022-11-16 11:51:40,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488419411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:40,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:40,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:51:40,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548293050] [2022-11-16 11:51:40,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:40,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:51:40,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:40,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:51:40,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:51:40,563 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-11-16 11:51:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:40,805 INFO L93 Difference]: Finished difference Result 145 states and 155 transitions. [2022-11-16 11:51:40,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:51:40,806 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-11-16 11:51:40,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:40,808 INFO L225 Difference]: With dead ends: 145 [2022-11-16 11:51:40,808 INFO L226 Difference]: Without dead ends: 145 [2022-11-16 11:51:40,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:51:40,810 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 5 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:40,811 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.2s Time] [2022-11-16 11:51:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-16 11:51:40,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2022-11-16 11:51:40,821 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-11-16 11:51:40,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-11-16 11:51:40,823 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 6 [2022-11-16 11:51:40,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:40,824 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-11-16 11:51:40,824 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-11-16 11:51:40,824 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-11-16 11:51:40,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:51:40,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:40,825 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:40,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:51:40,826 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-11-16 11:51:40,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:40,826 INFO L85 PathProgramCache]: Analyzing trace with hash 976905444, now seen corresponding path program 1 times [2022-11-16 11:51:40,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:40,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376852226] [2022-11-16 11:51:40,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:40,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:40,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:51:41,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:41,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376852226] [2022-11-16 11:51:41,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376852226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:41,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:41,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:51:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071887954] [2022-11-16 11:51:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:41,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:51:41,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:41,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:51:41,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:51:41,068 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-11-16 11:51:41,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:41,311 INFO L93 Difference]: Finished difference Result 156 states and 168 transitions. [2022-11-16 11:51:41,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:51:41,312 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-11-16 11:51:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:41,318 INFO L225 Difference]: With dead ends: 156 [2022-11-16 11:51:41,318 INFO L226 Difference]: Without dead ends: 156 [2022-11-16 11:51:41,320 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-11-16 11:51:41,328 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 10 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:41,331 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.2s Time] [2022-11-16 11:51:41,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-16 11:51:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 146. [2022-11-16 11:51:41,353 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-11-16 11:51:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 156 transitions. [2022-11-16 11:51:41,362 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 156 transitions. Word has length 14 [2022-11-16 11:51:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:41,363 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 156 transitions. [2022-11-16 11:51:41,363 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-11-16 11:51:41,363 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 156 transitions. [2022-11-16 11:51:41,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:51:41,365 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:41,365 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:41,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:51:41,366 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-11-16 11:51:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:41,367 INFO L85 PathProgramCache]: Analyzing trace with hash 302098592, now seen corresponding path program 1 times [2022-11-16 11:51:41,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:41,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579651695] [2022-11-16 11:51:41,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:41,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:41,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:41,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:41,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:41,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:51:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:41,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579651695] [2022-11-16 11:51:41,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579651695] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:41,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:41,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:51:41,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98791184] [2022-11-16 11:51:41,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:41,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:41,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:41,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:41,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:51:41,761 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-11-16 11:51:42,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:42,203 INFO L93 Difference]: Finished difference Result 146 states and 157 transitions. [2022-11-16 11:51:42,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:51:42,205 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-11-16 11:51:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:42,207 INFO L225 Difference]: With dead ends: 146 [2022-11-16 11:51:42,208 INFO L226 Difference]: Without dead ends: 146 [2022-11-16 11:51:42,208 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-11-16 11:51:42,209 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 21 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:42,210 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.4s Time] [2022-11-16 11:51:42,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-16 11:51:42,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2022-11-16 11:51:42,218 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-11-16 11:51:42,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 155 transitions. [2022-11-16 11:51:42,220 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 155 transitions. Word has length 24 [2022-11-16 11:51:42,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:42,221 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 155 transitions. [2022-11-16 11:51:42,221 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-11-16 11:51:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 155 transitions. [2022-11-16 11:51:42,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:51:42,222 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:42,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:51:42,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:51:42,223 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-11-16 11:51:42,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:42,223 INFO L85 PathProgramCache]: Analyzing trace with hash 302098593, now seen corresponding path program 1 times [2022-11-16 11:51:42,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:42,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474919374] [2022-11-16 11:51:42,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:42,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:42,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:42,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:42,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474919374] [2022-11-16 11:51:42,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474919374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:42,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:42,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:51:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64703393] [2022-11-16 11:51:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:42,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:42,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:42,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:51:42,617 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-11-16 11:51:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:43,034 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-11-16 11:51:43,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:51:43,038 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-11-16 11:51:43,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:43,039 INFO L225 Difference]: With dead ends: 145 [2022-11-16 11:51:43,039 INFO L226 Difference]: Without dead ends: 145 [2022-11-16 11:51:43,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:51:43,041 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 19 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:43,041 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.4s Time] [2022-11-16 11:51:43,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-16 11:51:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2022-11-16 11:51:43,050 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-11-16 11:51:43,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 154 transitions. [2022-11-16 11:51:43,052 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 154 transitions. Word has length 24 [2022-11-16 11:51:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:43,053 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 154 transitions. [2022-11-16 11:51:43,053 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-11-16 11:51:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 154 transitions. [2022-11-16 11:51:43,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:51:43,054 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:43,055 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-11-16 11:51:43,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:51:43,055 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-11-16 11:51:43,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:43,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029503, now seen corresponding path program 1 times [2022-11-16 11:51:43,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:43,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013512675] [2022-11-16 11:51:43,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:43,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:43,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:43,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:43,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:43,535 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:43,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:43,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013512675] [2022-11-16 11:51:43,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013512675] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:43,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615393717] [2022-11-16 11:51:43,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:43,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:43,543 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:43,567 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:51:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:43,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:51:43,734 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:43,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:51:43,946 WARN L855 $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-11-16 11:51:44,100 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:51:44,101 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-11-16 11:51:44,130 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:51:44,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:44,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615393717] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:44,222 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:44,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-16 11:51:44,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084276438] [2022-11-16 11:51:44,222 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:44,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:51:44,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:44,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:51:44,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=87, Unknown=1, NotChecked=18, Total=132 [2022-11-16 11:51:44,224 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-11-16 11:51:44,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:44,730 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2022-11-16 11:51:44,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:51:44,731 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-11-16 11:51:44,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:44,748 INFO L225 Difference]: With dead ends: 151 [2022-11-16 11:51:44,748 INFO L226 Difference]: Without dead ends: 151 [2022-11-16 11:51:44,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=124, Unknown=1, NotChecked=22, Total=182 [2022-11-16 11:51:44,749 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 5 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:44,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 565 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 441 Invalid, 0 Unknown, 170 Unchecked, 0.4s Time] [2022-11-16 11:51:44,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-16 11:51:44,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-11-16 11:51:44,756 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-11-16 11:51:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2022-11-16 11:51:44,757 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 26 [2022-11-16 11:51:44,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:44,758 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2022-11-16 11:51:44,758 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-11-16 11:51:44,758 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2022-11-16 11:51:44,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-16 11:51:44,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:44,759 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-11-16 11:51:44,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:44,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:44,970 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-11-16 11:51:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:44,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1741029502, now seen corresponding path program 1 times [2022-11-16 11:51:44,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:44,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136492956] [2022-11-16 11:51:44,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:44,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:45,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:45,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:45,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:45,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:45,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136492956] [2022-11-16 11:51:45,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136492956] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:45,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151248413] [2022-11-16 11:51:45,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:45,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:45,738 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:45,739 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:45,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:51:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:45,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-16 11:51:45,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:45,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:51:46,184 WARN L855 $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-11-16 11:51:46,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:46,278 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-11-16 11:51:46,288 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:51:46,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:51:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-16 11:51:46,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:48,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151248413] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:48,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:48,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2022-11-16 11:51:48,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965158999] [2022-11-16 11:51:48,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:48,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:51:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:48,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:51:48,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=323, Unknown=1, NotChecked=36, Total=420 [2022-11-16 11:51:48,562 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-11-16 11:51:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:49,829 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2022-11-16 11:51:49,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:51:49,830 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-11-16 11:51:49,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:49,831 INFO L225 Difference]: With dead ends: 151 [2022-11-16 11:51:49,831 INFO L226 Difference]: Without dead ends: 151 [2022-11-16 11:51:49,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=79, Invalid=386, Unknown=1, NotChecked=40, Total=506 [2022-11-16 11:51:49,832 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 17 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 1174 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 150 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:49,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 939 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1174 Invalid, 0 Unknown, 150 Unchecked, 1.1s Time] [2022-11-16 11:51:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-16 11:51:49,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2022-11-16 11:51:49,848 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-11-16 11:51:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-11-16 11:51:49,856 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 26 [2022-11-16 11:51:49,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:49,856 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-11-16 11:51:49,857 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-11-16 11:51:49,857 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-11-16 11:51:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-16 11:51:49,858 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:49,858 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-11-16 11:51:49,871 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-16 11:51:50,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:50,059 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-11-16 11:51:50,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:50,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1908047191, now seen corresponding path program 1 times [2022-11-16 11:51:50,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:50,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57483419] [2022-11-16 11:51:50,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:50,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:50,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:50,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:50,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:50,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:50,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:50,218 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:50,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:50,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57483419] [2022-11-16 11:51:50,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57483419] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:50,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906473808] [2022-11-16 11:51:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:50,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:50,220 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:50,221 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:50,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:51:50,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:50,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-16 11:51:50,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:50,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:50,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:50,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906473808] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:50,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:50,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-16 11:51:50,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744266334] [2022-11-16 11:51:50,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:50,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:51:50,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:50,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:51:50,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:51:50,496 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-11-16 11:51:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:50,768 INFO L93 Difference]: Finished difference Result 150 states and 161 transitions. [2022-11-16 11:51:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:51:50,769 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-11-16 11:51:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:50,770 INFO L225 Difference]: With dead ends: 150 [2022-11-16 11:51:50,770 INFO L226 Difference]: Without dead ends: 150 [2022-11-16 11:51:50,771 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-11-16 11:51:50,771 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 4 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:50,772 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.2s Time] [2022-11-16 11:51:50,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-16 11:51:50,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2022-11-16 11:51:50,784 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-11-16 11:51:50,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 160 transitions. [2022-11-16 11:51:50,787 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 160 transitions. Word has length 28 [2022-11-16 11:51:50,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:50,788 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 160 transitions. [2022-11-16 11:51:50,788 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-11-16 11:51:50,789 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 160 transitions. [2022-11-16 11:51:50,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:51:50,790 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:50,790 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-11-16 11:51:50,802 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:50,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:50,997 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-11-16 11:51:50,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:50,997 INFO L85 PathProgramCache]: Analyzing trace with hash -984859886, now seen corresponding path program 1 times [2022-11-16 11:51:50,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:50,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907257693] [2022-11-16 11:51:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:51,144 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:51:51,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:51,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907257693] [2022-11-16 11:51:51,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907257693] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:51,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082760405] [2022-11-16 11:51:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:51,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:51,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:51,148 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:51,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:51:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:51,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-16 11:51:51,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:51:51,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:51,391 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:51:51,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-11-16 11:51:51,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:51:51,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082760405] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:51,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:51,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-16 11:51:51,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292577955] [2022-11-16 11:51:51,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:51,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:51:51,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:51,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:51:51,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:51:51,422 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-11-16 11:51:51,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:51,758 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2022-11-16 11:51:51,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:51:51,759 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-11-16 11:51:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:51,760 INFO L225 Difference]: With dead ends: 154 [2022-11-16 11:51:51,760 INFO L226 Difference]: Without dead ends: 154 [2022-11-16 11:51:51,761 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-11-16 11:51:51,761 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 13 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:51,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 351 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:51:51,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-11-16 11:51:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-11-16 11:51:51,766 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-11-16 11:51:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-11-16 11:51:51,772 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 29 [2022-11-16 11:51:51,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:51,773 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-11-16 11:51:51,773 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-11-16 11:51:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-11-16 11:51:51,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-16 11:51:51,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:51,777 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-11-16 11:51:51,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:51,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:51,984 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-11-16 11:51:51,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:51,984 INFO L85 PathProgramCache]: Analyzing trace with hash -984859885, now seen corresponding path program 1 times [2022-11-16 11:51:51,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:51,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695663194] [2022-11-16 11:51:51,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:51,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:52,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:52,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:52,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:52,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:52,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695663194] [2022-11-16 11:51:52,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695663194] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:52,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785091975] [2022-11-16 11:51:52,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:52,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:52,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:52,345 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:52,360 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:51:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:52,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-16 11:51:52,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:52,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:52,768 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 11:51:52,768 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-11-16 11:51:52,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:52,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785091975] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:51:52,943 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:51:52,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-16 11:51:52,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520020464] [2022-11-16 11:51:52,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:52,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:51:52,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:52,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:51:52,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:51:52,945 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-11-16 11:51:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:53,432 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-11-16 11:51:53,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:51:53,433 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-11-16 11:51:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:53,434 INFO L225 Difference]: With dead ends: 159 [2022-11-16 11:51:53,435 INFO L226 Difference]: Without dead ends: 159 [2022-11-16 11:51:53,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-16 11:51:53,436 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 30 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:53,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1198 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-16 11:51:53,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-16 11:51:53,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 152. [2022-11-16 11:51:53,441 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-11-16 11:51:53,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 164 transitions. [2022-11-16 11:51:53,442 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 164 transitions. Word has length 29 [2022-11-16 11:51:53,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:53,443 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 164 transitions. [2022-11-16 11:51:53,443 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-11-16 11:51:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 164 transitions. [2022-11-16 11:51:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:51:53,444 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:53,444 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-11-16 11:51:53,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:53,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-16 11:51:53,651 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-11-16 11:51:53,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:53,651 INFO L85 PathProgramCache]: Analyzing trace with hash -465885389, now seen corresponding path program 1 times [2022-11-16 11:51:53,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:53,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359450518] [2022-11-16 11:51:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:53,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:53,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:53,852 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:51:53,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:53,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359450518] [2022-11-16 11:51:53,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359450518] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:53,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:53,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:51:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206113043] [2022-11-16 11:51:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:53,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:51:53,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:51:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:51:53,855 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-11-16 11:51:54,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:54,337 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-11-16 11:51:54,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:51:54,338 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-11-16 11:51:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:54,339 INFO L225 Difference]: With dead ends: 152 [2022-11-16 11:51:54,339 INFO L226 Difference]: Without dead ends: 152 [2022-11-16 11:51:54,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:51:54,340 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 24 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:54,340 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.4s Time] [2022-11-16 11:51:54,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-16 11:51:54,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2022-11-16 11:51:54,347 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-11-16 11:51:54,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2022-11-16 11:51:54,348 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 30 [2022-11-16 11:51:54,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:54,349 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2022-11-16 11:51:54,349 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-11-16 11:51:54,349 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2022-11-16 11:51:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-16 11:51:54,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:54,354 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-11-16 11:51:54,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:51:54,354 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-11-16 11:51:54,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:54,355 INFO L85 PathProgramCache]: Analyzing trace with hash -465885388, now seen corresponding path program 1 times [2022-11-16 11:51:54,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:54,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163460681] [2022-11-16 11:51:54,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:54,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:54,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:54,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:54,763 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:51:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:54,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163460681] [2022-11-16 11:51:54,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163460681] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:54,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:51:54,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:51:54,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013333609] [2022-11-16 11:51:54,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:54,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:51:54,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:54,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:51:54,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:51:54,766 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-11-16 11:51:55,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:55,266 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2022-11-16 11:51:55,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:51:55,266 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-11-16 11:51:55,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:55,268 INFO L225 Difference]: With dead ends: 150 [2022-11-16 11:51:55,268 INFO L226 Difference]: Without dead ends: 150 [2022-11-16 11:51:55,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:51:55,268 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 20 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:55,269 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.5s Time] [2022-11-16 11:51:55,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-16 11:51:55,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-16 11:51:55,272 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-11-16 11:51:55,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 162 transitions. [2022-11-16 11:51:55,273 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 162 transitions. Word has length 30 [2022-11-16 11:51:55,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:55,274 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 162 transitions. [2022-11-16 11:51:55,274 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-11-16 11:51:55,274 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 162 transitions. [2022-11-16 11:51:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-16 11:51:55,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:55,277 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-11-16 11:51:55,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:51:55,277 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-11-16 11:51:55,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:55,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1959133359, now seen corresponding path program 1 times [2022-11-16 11:51:55,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:55,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374213122] [2022-11-16 11:51:55,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:55,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:55,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:55,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:55,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 11:51:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-16 11:51:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:55,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374213122] [2022-11-16 11:51:55,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374213122] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:55,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627367439] [2022-11-16 11:51:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:55,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:55,457 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:55,458 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:55,469 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:51:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:55,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:51:55,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-16 11:51:55,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:51:55,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627367439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:51:55,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:51:55,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-16 11:51:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333825842] [2022-11-16 11:51:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:51:55,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:51:55,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:55,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:51:55,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:51:55,731 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-11-16 11:51:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:55,746 INFO L93 Difference]: Finished difference Result 138 states and 146 transitions. [2022-11-16 11:51:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:51:55,747 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-11-16 11:51:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:55,748 INFO L225 Difference]: With dead ends: 138 [2022-11-16 11:51:55,749 INFO L226 Difference]: Without dead ends: 138 [2022-11-16 11:51:55,749 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-11-16 11:51:55,750 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 124 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:55,750 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 170 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:51:55,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-16 11:51:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-16 11:51:55,754 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-11-16 11:51:55,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2022-11-16 11:51:55,755 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 41 [2022-11-16 11:51:55,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:55,755 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2022-11-16 11:51:55,756 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-11-16 11:51:55,756 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-11-16 11:51:55,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:51:55,756 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:55,757 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-11-16 11:51:55,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:55,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-16 11:51:55,964 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-11-16 11:51:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:55,964 INFO L85 PathProgramCache]: Analyzing trace with hash -930567857, now seen corresponding path program 1 times [2022-11-16 11:51:55,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:55,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363221795] [2022-11-16 11:51:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:55,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:56,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:56,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:51:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:51:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:56,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363221795] [2022-11-16 11:51:56,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363221795] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:56,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130854054] [2022-11-16 11:51:56,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:56,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:56,691 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:51:56,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:56,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-16 11:51:56,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:51:56,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:51:56,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:51:57,010 WARN L855 $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-11-16 11:51:57,029 WARN L855 $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-11-16 11:51:57,055 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-16 11:51:57,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 18 [2022-11-16 11:51:57,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-11-16 11:51:57,160 WARN L855 $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-11-16 11:51:57,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:51:57,250 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-11-16 11:51:57,340 WARN L855 $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-11-16 11:51:57,369 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:51:57,370 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-11-16 11:51:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 21 not checked. [2022-11-16 11:51:57,383 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:51:57,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130854054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:57,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:51:57,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2022-11-16 11:51:57,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691447926] [2022-11-16 11:51:57,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:51:57,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:51:57,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:51:57,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:51:57,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=221, Unknown=4, NotChecked=132, Total=420 [2022-11-16 11:51:57,687 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-11-16 11:51:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:51:58,528 INFO L93 Difference]: Finished difference Result 147 states and 156 transitions. [2022-11-16 11:51:58,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:51:58,528 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-11-16 11:51:58,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:51:58,529 INFO L225 Difference]: With dead ends: 147 [2022-11-16 11:51:58,530 INFO L226 Difference]: Without dead ends: 147 [2022-11-16 11:51:58,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=311, Unknown=4, NotChecked=156, Total=552 [2022-11-16 11:51:58,531 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 200 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 518 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:51:58,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 521 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 619 Invalid, 0 Unknown, 518 Unchecked, 0.6s Time] [2022-11-16 11:51:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-11-16 11:51:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2022-11-16 11:51:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.7236842105263157) internal successors, (131), 124 states have internal predecessors, (131), 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-11-16 11:51:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2022-11-16 11:51:58,535 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 43 [2022-11-16 11:51:58,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:51:58,536 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2022-11-16 11:51:58,536 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-11-16 11:51:58,536 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-11-16 11:51:58,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-16 11:51:58,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:51:58,537 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-11-16 11:51:58,550 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:51:58,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:58,745 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-11-16 11:51:58,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:51:58,745 INFO L85 PathProgramCache]: Analyzing trace with hash -930567856, now seen corresponding path program 1 times [2022-11-16 11:51:58,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:51:58,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201115467] [2022-11-16 11:51:58,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:58,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:51:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:59,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:51:59,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:59,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:51:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:59,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:51:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:51:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-16 11:51:59,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:51:59,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201115467] [2022-11-16 11:51:59,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201115467] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:51:59,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110421995] [2022-11-16 11:51:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:51:59,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:51:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:51:59,771 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:51:59,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:52:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:00,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:52:00,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:00,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:52:00,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:52:00,128 WARN L855 $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-11-16 11:52:00,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:00,185 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-11-16 11:52:00,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:52:00,229 WARN L855 $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-11-16 11:52:00,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:00,288 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-11-16 11:52:00,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:52:00,408 WARN L855 $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-11-16 11:52:00,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:00,464 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-11-16 11:52:00,496 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-16 11:52:00,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:00,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110421995] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:00,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:52:00,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 18 [2022-11-16 11:52:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795559043] [2022-11-16 11:52:00,674 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:52:00,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:52:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:00,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:52:00,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=251, Unknown=3, NotChecked=102, Total=420 [2022-11-16 11:52:00,675 INFO L87 Difference]: Start difference. First operand 129 states and 137 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-11-16 11:52:01,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:01,351 INFO L93 Difference]: Finished difference Result 137 states and 146 transitions. [2022-11-16 11:52:01,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:52:01,352 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-11-16 11:52:01,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:01,353 INFO L225 Difference]: With dead ends: 137 [2022-11-16 11:52:01,353 INFO L226 Difference]: Without dead ends: 137 [2022-11-16 11:52:01,353 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=335, Unknown=3, NotChecked=120, Total=552 [2022-11-16 11:52:01,354 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 418 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:01,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 267 Invalid, 831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 388 Invalid, 0 Unknown, 417 Unchecked, 0.5s Time] [2022-11-16 11:52:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-11-16 11:52:01,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 119. [2022-11-16 11:52:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 76 states have (on average 1.5921052631578947) internal successors, (121), 114 states have internal predecessors, (121), 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-11-16 11:52:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2022-11-16 11:52:01,358 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 43 [2022-11-16 11:52:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:01,359 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2022-11-16 11:52:01,359 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-11-16 11:52:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2022-11-16 11:52:01,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 11:52:01,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:01,360 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-11-16 11:52:01,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:01,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:01,570 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-11-16 11:52:01,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:01,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883970, now seen corresponding path program 1 times [2022-11-16 11:52:01,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:01,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507020510] [2022-11-16 11:52:01,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:01,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:02,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:02,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-16 11:52:02,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:02,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507020510] [2022-11-16 11:52:02,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507020510] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:02,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987773624] [2022-11-16 11:52:02,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:02,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:02,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:02,719 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:02,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:52:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:02,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-16 11:52:03,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:03,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:52:03,348 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-11-16 11:52:03,637 WARN L855 $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-11-16 11:52:03,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:03,713 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-11-16 11:52:03,747 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-16 11:52:03,748 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-11-16 11:52:03,842 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-11-16 11:52:03,866 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 11:52:03,867 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:04,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987773624] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:04,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:52:04,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2022-11-16 11:52:04,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925598629] [2022-11-16 11:52:04,084 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:52:04,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-11-16 11:52:04,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:04,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-11-16 11:52:04,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=650, Unknown=24, NotChecked=52, Total=812 [2022-11-16 11:52:04,086 INFO L87 Difference]: Start difference. First operand 119 states and 127 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-11-16 11:52:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:05,280 INFO L93 Difference]: Finished difference Result 205 states and 220 transitions. [2022-11-16 11:52:05,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-16 11:52:05,281 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-11-16 11:52:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:05,282 INFO L225 Difference]: With dead ends: 205 [2022-11-16 11:52:05,282 INFO L226 Difference]: Without dead ends: 205 [2022-11-16 11:52:05,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=138, Invalid=960, Unknown=28, NotChecked=64, Total=1190 [2022-11-16 11:52:05,284 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 117 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 192 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:05,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 700 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 779 Invalid, 0 Unknown, 192 Unchecked, 0.8s Time] [2022-11-16 11:52:05,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-11-16 11:52:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 126. [2022-11-16 11:52:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 121 states have internal predecessors, (138), 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-11-16 11:52:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 144 transitions. [2022-11-16 11:52:05,289 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 144 transitions. Word has length 46 [2022-11-16 11:52:05,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:05,290 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 144 transitions. [2022-11-16 11:52:05,290 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-11-16 11:52:05,290 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 144 transitions. [2022-11-16 11:52:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-16 11:52:05,291 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:05,291 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-11-16 11:52:05,299 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:05,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-16 11:52:05,498 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-11-16 11:52:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1466883971, now seen corresponding path program 1 times [2022-11-16 11:52:05,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:05,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723455595] [2022-11-16 11:52:05,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:05,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:06,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:06,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:07,558 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:52:07,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:07,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723455595] [2022-11-16 11:52:07,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723455595] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:07,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698312113] [2022-11-16 11:52:07,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:07,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:07,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:07,561 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:07,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:52:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:07,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 11:52:07,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:07,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:52:07,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:52:08,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-16 11:52:08,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:52:08,920 WARN L855 $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-11-16 11:52:09,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:09,011 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-11-16 11:52:09,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:09,024 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-11-16 11:52:09,038 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-16 11:52:09,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-16 11:52:09,046 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-11-16 11:52:09,127 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-11-16 11:52:09,138 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-11-16 11:52:09,163 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-16 11:52:09,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:09,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698312113] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:09,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:52:09,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 30 [2022-11-16 11:52:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632312679] [2022-11-16 11:52:09,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:52:09,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-16 11:52:09,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:09,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-16 11:52:09,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1015, Unknown=1, NotChecked=64, Total=1190 [2022-11-16 11:52:09,583 INFO L87 Difference]: Start difference. First operand 126 states and 144 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-11-16 11:52:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:11,945 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2022-11-16 11:52:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-16 11:52:11,946 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-11-16 11:52:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:11,947 INFO L225 Difference]: With dead ends: 206 [2022-11-16 11:52:11,947 INFO L226 Difference]: Without dead ends: 206 [2022-11-16 11:52:11,948 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=220, Invalid=1763, Unknown=1, NotChecked=86, Total=2070 [2022-11-16 11:52:11,949 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 592 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 593 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 1576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 143 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:11,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [593 Valid, 841 Invalid, 1576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1414 Invalid, 0 Unknown, 143 Unchecked, 1.6s Time] [2022-11-16 11:52:11,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-16 11:52:11,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 126. [2022-11-16 11:52:11,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 121 states have internal predecessors, (136), 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-11-16 11:52:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2022-11-16 11:52:11,955 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 46 [2022-11-16 11:52:11,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:11,956 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2022-11-16 11:52:11,956 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-11-16 11:52:11,957 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2022-11-16 11:52:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-16 11:52:11,957 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:11,958 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-11-16 11:52:11,975 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:12,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:12,164 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-11-16 11:52:12,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:12,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1771238793, now seen corresponding path program 1 times [2022-11-16 11:52:12,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:12,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439055493] [2022-11-16 11:52:12,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:12,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:12,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:12,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:12,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:12,308 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:52:12,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:12,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439055493] [2022-11-16 11:52:12,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439055493] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:12,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:12,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:52:12,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62262429] [2022-11-16 11:52:12,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:12,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:52:12,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:12,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:52:12,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:52:12,311 INFO L87 Difference]: Start difference. First operand 126 states and 142 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-11-16 11:52:12,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:12,461 INFO L93 Difference]: Finished difference Result 166 states and 178 transitions. [2022-11-16 11:52:12,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:52:12,462 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-11-16 11:52:12,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:12,463 INFO L225 Difference]: With dead ends: 166 [2022-11-16 11:52:12,463 INFO L226 Difference]: Without dead ends: 166 [2022-11-16 11:52:12,463 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-11-16 11:52:12,464 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 78 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:12,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 260 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:52:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-11-16 11:52:12,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 122. [2022-11-16 11:52:12,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 117 states have internal predecessors, (125), 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-11-16 11:52:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2022-11-16 11:52:12,468 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 47 [2022-11-16 11:52:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:12,469 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2022-11-16 11:52:12,469 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-11-16 11:52:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2022-11-16 11:52:12,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 11:52:12,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:12,470 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-11-16 11:52:12,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:52:12,470 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-11-16 11:52:12,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:12,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997608, now seen corresponding path program 1 times [2022-11-16 11:52:12,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:12,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360777756] [2022-11-16 11:52:12,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:12,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:12,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:12,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:12,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:12,665 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-16 11:52:12,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:12,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360777756] [2022-11-16 11:52:12,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360777756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:12,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:12,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:52:12,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577270990] [2022-11-16 11:52:12,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:12,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:52:12,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:12,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:52:12,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:52:12,668 INFO L87 Difference]: Start difference. First operand 122 states and 131 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-11-16 11:52:12,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:12,972 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2022-11-16 11:52:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:52:12,973 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-11-16 11:52:12,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:12,974 INFO L225 Difference]: With dead ends: 134 [2022-11-16 11:52:12,974 INFO L226 Difference]: Without dead ends: 134 [2022-11-16 11:52:12,974 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-11-16 11:52:12,975 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 86 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:12,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 307 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:52:12,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-16 11:52:12,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 116. [2022-11-16 11:52:12,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 111 states have internal predecessors, (119), 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-11-16 11:52:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2022-11-16 11:52:12,979 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 49 [2022-11-16 11:52:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:12,979 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2022-11-16 11:52:12,979 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-11-16 11:52:12,980 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-11-16 11:52:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 11:52:12,980 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:12,980 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-11-16 11:52:12,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-16 11:52:12,980 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-11-16 11:52:12,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:12,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1352997607, now seen corresponding path program 1 times [2022-11-16 11:52:12,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:12,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024403868] [2022-11-16 11:52:12,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:12,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:13,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:52:13,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:13,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024403868] [2022-11-16 11:52:13,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024403868] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:13,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:13,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:52:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423814935] [2022-11-16 11:52:13,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:13,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:52:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:13,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:52:13,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:52:13,171 INFO L87 Difference]: Start difference. First operand 116 states and 125 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-11-16 11:52:13,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:13,327 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2022-11-16 11:52:13,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:52:13,327 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-11-16 11:52:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:13,328 INFO L225 Difference]: With dead ends: 115 [2022-11-16 11:52:13,328 INFO L226 Difference]: Without dead ends: 115 [2022-11-16 11:52:13,329 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-11-16 11:52:13,329 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 100 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:13,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 279 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:52:13,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-11-16 11:52:13,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2022-11-16 11:52:13,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 78 states have (on average 1.5) internal successors, (117), 110 states have internal predecessors, (117), 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-11-16 11:52:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2022-11-16 11:52:13,333 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 49 [2022-11-16 11:52:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:13,334 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2022-11-16 11:52:13,334 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-11-16 11:52:13,334 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2022-11-16 11:52:13,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-16 11:52:13,354 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:13,354 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-11-16 11:52:13,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-16 11:52:13,354 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-11-16 11:52:13,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:13,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1351857860, now seen corresponding path program 1 times [2022-11-16 11:52:13,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:13,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910549002] [2022-11-16 11:52:13,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:13,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:13,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,583 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:52:13,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:13,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910549002] [2022-11-16 11:52:13,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910549002] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:13,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:13,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:52:13,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072604478] [2022-11-16 11:52:13,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:13,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:52:13,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:13,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:52:13,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:52:13,586 INFO L87 Difference]: Start difference. First operand 115 states and 123 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-11-16 11:52:13,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:13,750 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-11-16 11:52:13,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:52:13,751 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-11-16 11:52:13,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:13,751 INFO L225 Difference]: With dead ends: 112 [2022-11-16 11:52:13,752 INFO L226 Difference]: Without dead ends: 112 [2022-11-16 11:52:13,752 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-11-16 11:52:13,752 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 179 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:13,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 220 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:52:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-16 11:52:13,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-16 11:52:13,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.4675324675324675) internal successors, (113), 107 states have internal predecessors, (113), 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-11-16 11:52:13,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2022-11-16 11:52:13,756 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 49 [2022-11-16 11:52:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:13,756 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2022-11-16 11:52:13,756 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-11-16 11:52:13,757 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2022-11-16 11:52:13,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 11:52:13,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:13,757 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-11-16 11:52:13,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:52:13,758 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-11-16 11:52:13,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:13,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077693, now seen corresponding path program 1 times [2022-11-16 11:52:13,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:13,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435423152] [2022-11-16 11:52:13,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:13,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:13,894 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:52:13,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:13,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435423152] [2022-11-16 11:52:13,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435423152] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:13,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:13,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:52:13,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881285741] [2022-11-16 11:52:13,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:13,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:52:13,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:13,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:52:13,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:52:13,897 INFO L87 Difference]: Start difference. First operand 112 states and 119 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-11-16 11:52:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:14,122 INFO L93 Difference]: Finished difference Result 171 states and 183 transitions. [2022-11-16 11:52:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:52:14,123 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-11-16 11:52:14,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:14,124 INFO L225 Difference]: With dead ends: 171 [2022-11-16 11:52:14,124 INFO L226 Difference]: Without dead ends: 171 [2022-11-16 11:52:14,124 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-11-16 11:52:14,125 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 166 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:14,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 215 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:52:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-11-16 11:52:14,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 111. [2022-11-16 11:52:14,129 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-11-16 11:52:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 118 transitions. [2022-11-16 11:52:14,129 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 118 transitions. Word has length 50 [2022-11-16 11:52:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:14,130 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 118 transitions. [2022-11-16 11:52:14,130 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-11-16 11:52:14,130 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 118 transitions. [2022-11-16 11:52:14,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-16 11:52:14,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:14,131 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-11-16 11:52:14,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:52:14,131 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-11-16 11:52:14,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:14,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1042077694, now seen corresponding path program 1 times [2022-11-16 11:52:14,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:14,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180034270] [2022-11-16 11:52:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:14,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:14,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:14,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:14,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:14,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:14,331 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:52:14,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:14,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180034270] [2022-11-16 11:52:14,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180034270] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:14,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:14,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:52:14,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402602219] [2022-11-16 11:52:14,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:14,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:52:14,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:14,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:52:14,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:52:14,334 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-11-16 11:52:14,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:14,544 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-11-16 11:52:14,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:52:14,545 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-11-16 11:52:14,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:14,546 INFO L225 Difference]: With dead ends: 110 [2022-11-16 11:52:14,546 INFO L226 Difference]: Without dead ends: 110 [2022-11-16 11:52:14,546 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-11-16 11:52:14,546 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 83 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:14,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 204 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:52:14,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-16 11:52:14,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-11-16 11:52:14,549 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-11-16 11:52:14,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2022-11-16 11:52:14,550 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 50 [2022-11-16 11:52:14,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:14,550 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2022-11-16 11:52:14,550 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-11-16 11:52:14,551 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2022-11-16 11:52:14,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 11:52:14,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:14,551 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-11-16 11:52:14,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:52:14,551 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-11-16 11:52:14,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:14,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2055329845, now seen corresponding path program 1 times [2022-11-16 11:52:14,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:14,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188116582] [2022-11-16 11:52:14,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:14,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:14,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:14,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:14,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:14,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:52:14,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:14,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188116582] [2022-11-16 11:52:14,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188116582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:14,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:14,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:52:14,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584181568] [2022-11-16 11:52:14,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:14,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:52:14,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:14,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:52:14,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:52:14,911 INFO L87 Difference]: Start difference. First operand 110 states and 117 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-11-16 11:52:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:15,166 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2022-11-16 11:52:15,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:52:15,167 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-11-16 11:52:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:15,168 INFO L225 Difference]: With dead ends: 104 [2022-11-16 11:52:15,168 INFO L226 Difference]: Without dead ends: 104 [2022-11-16 11:52:15,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:52:15,168 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 77 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:15,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 314 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:52:15,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-16 11:52:15,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-16 11:52:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 99 states have internal predecessors, (105), 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-11-16 11:52:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2022-11-16 11:52:15,172 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 51 [2022-11-16 11:52:15,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:15,172 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2022-11-16 11:52:15,172 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-11-16 11:52:15,172 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2022-11-16 11:52:15,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 11:52:15,173 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:15,173 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-11-16 11:52:15,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:52:15,173 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-11-16 11:52:15,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash 512975501, now seen corresponding path program 1 times [2022-11-16 11:52:15,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:15,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39208036] [2022-11-16 11:52:15,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:15,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:16,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:16,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:16,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:16,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:18,111 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:52:18,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:18,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39208036] [2022-11-16 11:52:18,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39208036] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:18,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132121837] [2022-11-16 11:52:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:18,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:18,112 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:18,113 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:18,115 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:52:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:18,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 98 conjunts are in the unsatisfiable core [2022-11-16 11:52:18,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:18,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:52:18,905 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:52:18,906 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-11-16 11:52:19,091 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-11-16 11:52:19,231 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:52:19,232 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-11-16 11:52:19,478 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:52:19,478 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-11-16 11:52:19,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:19,578 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-11-16 11:52:19,781 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:52:19,782 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-11-16 11:52:19,791 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-11-16 11:52:20,074 WARN L855 $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-11-16 11:52:20,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:20,148 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:52:20,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 45 treesize of output 43 [2022-11-16 11:52:20,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:20,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:52:20,201 INFO L321 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-16 11:52:20,202 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-11-16 11:52:20,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:52:20,519 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:52:20,519 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-11-16 11:52:20,705 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:52:20,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:20,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132121837] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:20,979 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:52:20,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 47 [2022-11-16 11:52:20,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099354105] [2022-11-16 11:52:20,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:52:20,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-16 11:52:20,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:20,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-16 11:52:20,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=2083, Unknown=1, NotChecked=92, Total=2352 [2022-11-16 11:52:20,982 INFO L87 Difference]: Start difference. First operand 104 states and 111 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-11-16 11:52:22,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:22,731 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2022-11-16 11:52:22,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:52:22,732 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-11-16 11:52:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:22,733 INFO L225 Difference]: With dead ends: 103 [2022-11-16 11:52:22,733 INFO L226 Difference]: Without dead ends: 103 [2022-11-16 11:52:22,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=257, Invalid=2716, Unknown=1, NotChecked=106, Total=3080 [2022-11-16 11:52:22,735 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 47 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:22,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1144 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 915 Invalid, 0 Unknown, 210 Unchecked, 1.1s Time] [2022-11-16 11:52:22,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-16 11:52:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-11-16 11:52:22,739 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-11-16 11:52:22,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 110 transitions. [2022-11-16 11:52:22,740 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 110 transitions. Word has length 53 [2022-11-16 11:52:22,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:22,740 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 110 transitions. [2022-11-16 11:52:22,741 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-11-16 11:52:22,741 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 110 transitions. [2022-11-16 11:52:22,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-16 11:52:22,742 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:22,742 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-11-16 11:52:22,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:22,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-16 11:52:22,949 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-11-16 11:52:22,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:22,950 INFO L85 PathProgramCache]: Analyzing trace with hash 512975502, now seen corresponding path program 1 times [2022-11-16 11:52:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:22,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262619161] [2022-11-16 11:52:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:25,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:25,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:25,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:52:27,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:27,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262619161] [2022-11-16 11:52:27,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262619161] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:27,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617147250] [2022-11-16 11:52:27,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:27,051 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:27,053 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:52:27,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:27,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 115 conjunts are in the unsatisfiable core [2022-11-16 11:52:27,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:27,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:52:27,977 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:52:27,977 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-11-16 11:52:28,229 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-11-16 11:52:28,257 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-11-16 11:52:28,424 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:52:28,424 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-11-16 11:52:28,431 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-11-16 11:52:28,760 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:52:28,761 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-11-16 11:52:28,771 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-11-16 11:52:28,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:28,925 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-11-16 11:52:28,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:28,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 0 case distinctions, treesize of input 46 treesize of output 37 [2022-11-16 11:52:29,284 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:52:29,284 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-11-16 11:52:29,298 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-11-16 11:52:29,634 WARN L855 $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-11-16 11:52:29,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:29,703 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:29,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:29,705 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-11-16 11:52:29,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:29,728 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:52:29,729 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-11-16 11:52:29,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:29,738 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-11-16 11:52:29,764 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:52:29,765 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-11-16 11:52:30,168 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-16 11:52:30,169 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-11-16 11:52:30,180 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:52:30,181 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-11-16 11:52:30,357 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-16 11:52:30,357 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:52:31,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617147250] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:31,190 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:52:31,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 51 [2022-11-16 11:52:31,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47646251] [2022-11-16 11:52:31,191 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:52:31,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-11-16 11:52:31,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:31,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-11-16 11:52:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3013, Unknown=1, NotChecked=110, Total=3306 [2022-11-16 11:52:31,194 INFO L87 Difference]: Start difference. First operand 103 states and 110 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-11-16 11:52:35,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:35,338 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-11-16 11:52:35,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-16 11:52:35,338 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-11-16 11:52:35,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:35,339 INFO L225 Difference]: With dead ends: 102 [2022-11-16 11:52:35,340 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 11:52:35,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 39 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1257 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=339, Invalid=4494, Unknown=1, NotChecked=136, Total=4970 [2022-11-16 11:52:35,343 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 158 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 1347 SdHoareTripleChecker+Invalid, 2156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 213 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:35,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 1347 Invalid, 2156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1898 Invalid, 0 Unknown, 213 Unchecked, 2.0s Time] [2022-11-16 11:52:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 11:52:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-11-16 11:52:35,362 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-11-16 11:52:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2022-11-16 11:52:35,362 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 53 [2022-11-16 11:52:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:35,363 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2022-11-16 11:52:35,363 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-11-16 11:52:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2022-11-16 11:52:35,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-16 11:52:35,364 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:35,364 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] [2022-11-16 11:52:35,371 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:52:35,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-16 11:52:35,571 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 11:52:35,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:35,572 INFO L85 PathProgramCache]: Analyzing trace with hash -951779474, now seen corresponding path program 1 times [2022-11-16 11:52:35,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:35,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384179095] [2022-11-16 11:52:35,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:35,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:35,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:35,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:35,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:35,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:35,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-16 11:52:35,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:35,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384179095] [2022-11-16 11:52:35,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384179095] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:52:35,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:52:35,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:52:35,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763601899] [2022-11-16 11:52:35,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:52:35,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:52:35,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:52:35,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:52:35,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:52:35,746 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-11-16 11:52:35,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:52:35,918 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-11-16 11:52:35,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:52:35,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 55 [2022-11-16 11:52:35,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:52:35,919 INFO L225 Difference]: With dead ends: 119 [2022-11-16 11:52:35,919 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 11:52:35,920 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-11-16 11:52:35,920 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 160 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:52:35,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 171 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-16 11:52:35,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 11:52:35,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 101. [2022-11-16 11:52:35,924 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-11-16 11:52:35,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2022-11-16 11:52:35,924 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 55 [2022-11-16 11:52:35,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:52:35,925 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2022-11-16 11:52:35,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-11-16 11:52:35,925 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2022-11-16 11:52:35,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 11:52:35,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:52:35,926 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-11-16 11:52:35,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-16 11:52:35,927 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 11:52:35,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:52:35,927 INFO L85 PathProgramCache]: Analyzing trace with hash 167962770, now seen corresponding path program 1 times [2022-11-16 11:52:35,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:52:35,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935042497] [2022-11-16 11:52:35,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:35,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:52:35,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:38,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:52:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:38,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:52:38,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:52:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:52:39,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:52:39,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935042497] [2022-11-16 11:52:39,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935042497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:52:39,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948040035] [2022-11-16 11:52:39,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:52:39,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:52:39,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:52:39,831 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:52:39,840 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:52:40,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:52:40,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 116 conjunts are in the unsatisfiable core [2022-11-16 11:52:40,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:52:40,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:52:40,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:52:40,499 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:52:40,499 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-11-16 11:52:40,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:52:40,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:40,979 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:52:40,979 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-11-16 11:52:41,270 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-11-16 11:52:41,475 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:52:41,476 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-11-16 11:52:41,838 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:52:41,838 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-11-16 11:52:41,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:41,991 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-11-16 11:52:42,369 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:52:42,369 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-11-16 11:52:42,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:42,382 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-11-16 11:52:42,388 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-11-16 11:52:57,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:57,698 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 11:52:57,698 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-11-16 11:52:57,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:57,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:57,868 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:52:57,868 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-11-16 11:52:57,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:52:57,889 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-11-16 11:53:00,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:53:05,509 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:53:05,509 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-11-16 11:53:05,552 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-11-16 11:53:06,530 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:53:06,531 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-11-16 11:53:06,810 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:53:06,811 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-11-16 11:53:07,328 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-11-16 11:53:07,983 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-11-16 11:53:08,010 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:53:08,010 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:53:29,664 INFO L321 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-11-16 11:53:29,664 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-11-16 11:53:42,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base_33| Int) (v_ArrVal_4416 (Array Int Int)) (v_ArrVal_4428 (Array Int Int)) (v_ArrVal_4429 (Array Int Int)) (v_ArrVal_4418 (Array Int Int)) (|v_node_create_~temp~0#1.base_64| Int) (v_ArrVal_4419 (Array Int Int))) (or (< |v_node_create_~temp~0#1.base_64| |v_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base_33|) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_64| v_ArrVal_4429))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (= (select (select (store (store (store .cse0 .cse1 v_ArrVal_4416) |v_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base_33| v_ArrVal_4418) (select (select .cse0 .cse1) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_64| v_ArrVal_4428) |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|)) v_ArrVal_4419) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse1))) (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-11-16 11:53:42,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948040035] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:53:42,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:53:42,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 61 [2022-11-16 11:53:42,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961446818] [2022-11-16 11:53:42,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:53:42,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-16 11:53:42,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:53:42,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-16 11:53:42,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=4528, Unknown=191, NotChecked=138, Total=5112 [2022-11-16 11:53:42,079 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-11-16 11:54:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:54:18,202 INFO L93 Difference]: Finished difference Result 225 states and 239 transitions. [2022-11-16 11:54:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-16 11:54:18,203 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-11-16 11:54:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:54:18,205 INFO L225 Difference]: With dead ends: 225 [2022-11-16 11:54:18,205 INFO L226 Difference]: Without dead ends: 225 [2022-11-16 11:54:18,208 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1801 ImplicationChecksByTransitivity, 78.1s TimeCoverageRelationStatistics Valid=685, Invalid=7500, Unknown=191, NotChecked=180, Total=8556 [2022-11-16 11:54:18,208 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 906 mSDsluCounter, 1684 mSDsCounter, 0 mSdLazyCounter, 3108 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1724 SdHoareTripleChecker+Invalid, 3265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 3108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 16.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:54:18,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1724 Invalid, 3265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 3108 Invalid, 0 Unknown, 72 Unchecked, 16.5s Time] [2022-11-16 11:54:18,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-16 11:54:18,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 104. [2022-11-16 11:54:18,213 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-11-16 11:54:18,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2022-11-16 11:54:18,214 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 57 [2022-11-16 11:54:18,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:54:18,214 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2022-11-16 11:54:18,215 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-11-16 11:54:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2022-11-16 11:54:18,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 11:54:18,216 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:54:18,216 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-11-16 11:54:18,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-16 11:54:18,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-16 11:54:18,423 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 11:54:18,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:54:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash 167962771, now seen corresponding path program 1 times [2022-11-16 11:54:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:54:18,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611863372] [2022-11-16 11:54:18,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:54:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:26,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:54:26,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:27,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:54:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:29,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:54:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 16 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:54:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:54:32,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611863372] [2022-11-16 11:54:32,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611863372] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:54:32,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186509979] [2022-11-16 11:54:32,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:54:32,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:54:32,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:54:32,532 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:54:32,535 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:54:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:54:32,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-16 11:54:32,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:54:32,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:54:33,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:54:34,539 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:54:34,539 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-11-16 11:54:35,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:54:37,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:37,170 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:54:37,170 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-11-16 11:54:38,492 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-11-16 11:54:39,383 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:54:39,383 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-11-16 11:54:40,903 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:54:40,903 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-11-16 11:54:41,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:41,501 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-11-16 11:54:42,966 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:54:42,966 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-11-16 11:54:42,984 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-11-16 11:54:43,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:43,002 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-11-16 11:54:43,016 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-11-16 11:54:46,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:46,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:54:46,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:46,374 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:54:46,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 63 [2022-11-16 11:54:46,492 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-16 11:54:46,493 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 26 [2022-11-16 11:54:46,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:46,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:46,653 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:54:46,653 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-11-16 11:54:52,138 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:54:52,138 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 102 treesize of output 73 [2022-11-16 11:54:52,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:52,170 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-11-16 11:54:52,184 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-11-16 11:54:52,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:52,910 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 41 treesize of output 37 [2022-11-16 11:54:53,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:53,025 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-11-16 11:54:53,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:53,064 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 41 treesize of output 37 [2022-11-16 11:54:53,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:54:53,112 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-11-16 11:54:53,740 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-11-16 11:54:53,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-16 11:54:54,494 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 34 treesize of output 18 [2022-11-16 11:54:54,510 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 24 treesize of output 10 [2022-11-16 11:54:54,553 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:54:54,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:54:57,241 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4731 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int)) (<= 0 (+ (select (select (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4731))) (store .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (forall ((v_ArrVal_4730 (Array Int Int)) (v_ArrVal_4731 (Array Int Int)) (|ULTIMATE.start_dll_circular_insert_~last~1#1.offset| Int) (v_ArrVal_4734 (Array Int Int))) (<= (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4731))) (store .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) (+ |ULTIMATE.start_dll_circular_insert_~last~1#1.offset| 4) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_4730) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_4734) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 11:55:06,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186509979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:06,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:55:06,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 66 [2022-11-16 11:55:06,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71991190] [2022-11-16 11:55:06,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:55:06,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-16 11:55:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:06,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-16 11:55:06,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=5856, Unknown=42, NotChecked=154, Total=6320 [2022-11-16 11:55:06,558 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand has 67 states, 62 states have (on average 1.596774193548387) internal successors, (99), 58 states have internal predecessors, (99), 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-11-16 11:55:31,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:31,555 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-11-16 11:55:31,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:55:31,556 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 62 states have (on average 1.596774193548387) internal successors, (99), 58 states have internal predecessors, (99), 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 57 [2022-11-16 11:55:31,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:31,557 INFO L225 Difference]: With dead ends: 110 [2022-11-16 11:55:31,557 INFO L226 Difference]: Without dead ends: 110 [2022-11-16 11:55:31,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2183 ImplicationChecksByTransitivity, 50.3s TimeCoverageRelationStatistics Valid=514, Invalid=9145, Unknown=47, NotChecked=194, Total=9900 [2022-11-16 11:55:31,560 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 167 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 2141 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 205 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:31,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 1436 Invalid, 2423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2141 Invalid, 0 Unknown, 205 Unchecked, 10.6s Time] [2022-11-16 11:55:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-16 11:55:31,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2022-11-16 11:55:31,563 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-11-16 11:55:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2022-11-16 11:55:31,564 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 57 [2022-11-16 11:55:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:31,564 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2022-11-16 11:55:31,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 62 states have (on average 1.596774193548387) internal successors, (99), 58 states have internal predecessors, (99), 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-11-16 11:55:31,565 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2022-11-16 11:55:31,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:55:31,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:31,566 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-11-16 11:55:31,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:55:31,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-11-16 11:55:31,773 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 11:55:31,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:31,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560249, now seen corresponding path program 1 times [2022-11-16 11:55:31,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:31,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129063043] [2022-11-16 11:55:31,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:31,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:32,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:55:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:32,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:55:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:32,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:55:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:32,484 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:55:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:32,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129063043] [2022-11-16 11:55:32,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129063043] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:32,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627217367] [2022-11-16 11:55:32,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:32,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:32,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:32,487 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:55:32,489 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:55:32,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:32,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 28 conjunts are in the unsatisfiable core [2022-11-16 11:55:32,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:33,214 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:55:34,232 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-11-16 11:55:34,405 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-11-16 11:55:34,640 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 11:55:34,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:55:34,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627217367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:55:34,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:55:34,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7] total 17 [2022-11-16 11:55:34,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101786841] [2022-11-16 11:55:34,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:55:34,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-16 11:55:34,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:34,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-16 11:55:34,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:55:34,645 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-11-16 11:55:37,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:37,510 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2022-11-16 11:55:37,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-16 11:55:37,510 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-11-16 11:55:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:37,511 INFO L225 Difference]: With dead ends: 167 [2022-11-16 11:55:37,511 INFO L226 Difference]: Without dead ends: 167 [2022-11-16 11:55:37,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:55:37,513 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 251 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:37,513 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 551 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-11-16 11:55:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-16 11:55:37,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 107. [2022-11-16 11:55:37,517 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-11-16 11:55:37,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2022-11-16 11:55:37,518 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2022-11-16 11:55:37,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:37,518 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2022-11-16 11:55:37,518 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-11-16 11:55:37,518 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2022-11-16 11:55:37,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-16 11:55:37,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:37,519 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-11-16 11:55:37,536 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:55:37,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:37,727 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 11:55:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1157560248, now seen corresponding path program 1 times [2022-11-16 11:55:37,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:37,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896418963] [2022-11-16 11:55:37,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:37,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:37,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:38,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:55:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:38,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:55:38,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:55:38,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:38,456 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:55:38,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:38,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896418963] [2022-11-16 11:55:38,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896418963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:38,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234231614] [2022-11-16 11:55:38,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:38,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:38,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:38,459 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:55:38,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:55:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:38,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:55:38,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:38,935 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-11-16 11:55:39,044 WARN L855 $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_5288 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5288))))) is different from true [2022-11-16 11:55:39,197 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-11-16 11:55:39,269 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5289 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5289))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-16 11:55:39,409 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-11-16 11:55:39,561 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_5290 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_5290))) (not (= |node_create_~temp~0#1.base| 0)))) is different from true [2022-11-16 11:55:39,705 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-11-16 11:55:39,744 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-11-16 11:55:39,882 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-16 11:55:39,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-16 11:55:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 21 not checked. [2022-11-16 11:55:39,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:55:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-16 11:55:42,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234231614] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:55:42,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:55:42,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 7] total 17 [2022-11-16 11:55:42,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023341888] [2022-11-16 11:55:42,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:55:42,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-16 11:55:42,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:55:42,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-16 11:55:42,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2022-11-16 11:55:42,435 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-11-16 11:55:43,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:55:43,609 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-16 11:55:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:55:43,610 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-11-16 11:55:43,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:55:43,611 INFO L225 Difference]: With dead ends: 82 [2022-11-16 11:55:43,611 INFO L226 Difference]: Without dead ends: 82 [2022-11-16 11:55:43,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 106 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=112, Invalid=277, Unknown=3, NotChecked=114, Total=506 [2022-11-16 11:55:43,612 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 366 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 228 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:55:43,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 180 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 125 Invalid, 0 Unknown, 228 Unchecked, 0.6s Time] [2022-11-16 11:55:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-16 11:55:43,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-16 11:55:43,615 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-11-16 11:55:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-16 11:55:43,616 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 58 [2022-11-16 11:55:43,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:55:43,616 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-16 11:55:43,617 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-11-16 11:55:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-16 11:55:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-16 11:55:43,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:55:43,618 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-11-16 11:55:43,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:55:43,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:43,825 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 11:55:43,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:55:43,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1796531691, now seen corresponding path program 1 times [2022-11-16 11:55:43,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:55:43,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634881764] [2022-11-16 11:55:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:43,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:55:43,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:52,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:55:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:53,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:55:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:55,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:55:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:58,170 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:55:58,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:55:58,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634881764] [2022-11-16 11:55:58,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634881764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:55:58,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321091210] [2022-11-16 11:55:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:55:58,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:55:58,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:55:58,172 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:55:58,174 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:55:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:55:58,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 159 conjunts are in the unsatisfiable core [2022-11-16 11:55:58,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:55:58,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:55:59,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-11-16 11:56:00,379 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:56:00,380 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-11-16 11:56:01,442 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:56:02,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 11:56:03,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:03,323 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:56:03,324 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-11-16 11:56:04,658 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-11-16 11:56:04,726 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-11-16 11:56:05,607 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:56:05,608 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-11-16 11:56:05,669 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-11-16 11:56:07,244 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:56:07,245 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-11-16 11:56:07,260 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-11-16 11:56:07,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:07,900 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-11-16 11:56:07,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:07,960 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-11-16 11:56:09,433 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:56:09,434 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-11-16 11:56:09,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:09,463 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-11-16 11:56:09,478 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-11-16 11:56:09,492 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-11-16 11:56:12,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:12,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 16 treesize of output 11 [2022-11-16 11:56:12,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:12,368 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 11:56:12,369 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 60 [2022-11-16 11:56:12,506 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-16 11:56:12,507 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 20 treesize of output 23 [2022-11-16 11:56:12,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:56:12,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:12,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:12,678 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:56:12,678 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-11-16 11:56:18,362 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:56:18,362 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-11-16 11:56:18,391 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-11-16 11:56:18,413 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:18,414 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-11-16 11:56:18,429 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-11-16 11:56:19,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:19,109 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-11-16 11:56:19,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:19,149 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-11-16 11:56:19,176 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:56:19,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:19,328 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-11-16 11:56:19,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-11-16 11:56:19,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:56:19,404 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-11-16 11:56:20,059 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-11-16 11:56:20,086 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-11-16 11:56:20,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:56:20,679 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-11-16 11:56:20,693 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:56:21,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 11:56:22,190 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:56:22,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:56:23,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5617 (Array Int Int)) (v_ArrVal_5616 (Array Int Int)) (v_ArrVal_5618 (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_5616) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5618) |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_5617) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-16 11:56:23,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5613 (Array Int Int)) (v_ArrVal_5615 (Array Int Int)) (v_ArrVal_5614 (Array Int Int)) (v_ArrVal_5617 (Array Int Int)) (v_ArrVal_5616 (Array Int Int)) (v_ArrVal_5618 (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_5614) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5616) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5615) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5618) |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_5613) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5617) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-16 11:56:25,736 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5609 (Array Int Int)) (v_ArrVal_5607 Int) (v_ArrVal_5613 (Array Int Int)) (v_ArrVal_5615 (Array Int Int)) (v_ArrVal_5614 (Array Int Int)) (v_ArrVal_5606 (Array Int Int)) (v_ArrVal_5617 (Array Int Int)) (v_ArrVal_5616 (Array Int Int)) (v_ArrVal_5618 (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_5607)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5614) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5616) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5609) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5615) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5618) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5606) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5613) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5617) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-16 11:56:25,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5609 (Array Int Int)) (v_ArrVal_5607 Int) (v_ArrVal_5613 (Array Int Int)) (v_ArrVal_5615 (Array Int Int)) (v_ArrVal_5614 (Array Int Int)) (v_ArrVal_5606 (Array Int Int)) (v_ArrVal_5617 (Array Int Int)) (v_ArrVal_5616 (Array Int Int)) (v_ArrVal_5618 (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_5607)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5614) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5616) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_5609) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5615) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5618) |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_5606) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5613) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5617) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-16 11:57:00,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5607 Int) (v_ArrVal_5609 (Array Int Int)) (v_ArrVal_5631 (Array Int Int)) (v_ArrVal_5633 (Array Int Int)) (v_ArrVal_5632 (Array Int Int)) (v_ArrVal_5613 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| Int) (v_ArrVal_5615 (Array Int Int)) (v_ArrVal_5614 (Array Int Int)) (v_ArrVal_5606 (Array Int Int)) (v_ArrVal_5617 (Array Int Int)) (v_ArrVal_5616 (Array Int Int)) (v_ArrVal_5618 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31|))) (= |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_5632)) (.cse4 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5633))) (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_5631))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 v_ArrVal_5607))) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5614) .cse3 v_ArrVal_5616) (select (select (store (store (store .cse4 .cse1 v_ArrVal_5609) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5615) .cse3 v_ArrVal_5618) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store (store (store .cse5 .cse1 v_ArrVal_5606) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| v_ArrVal_5613) .cse3 v_ArrVal_5617) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_31| |c_#StackHeapBarrier|)))) is different from false [2022-11-16 11:57:00,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321091210] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:00,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:57:00,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 36] total 70 [2022-11-16 11:57:00,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752340824] [2022-11-16 11:57:00,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:57:00,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 11:57:00,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:57:00,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 11:57:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=5579, Unknown=137, NotChecked=780, Total=6806 [2022-11-16 11:57:00,398 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 70 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 61 states have internal predecessors, (100), 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-11-16 11:57:33,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:57:33,128 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2022-11-16 11:57:33,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 11:57:33,129 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 61 states have internal predecessors, (100), 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-11-16 11:57:33,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:57:33,129 INFO L225 Difference]: With dead ends: 101 [2022-11-16 11:57:33,129 INFO L226 Difference]: Without dead ends: 101 [2022-11-16 11:57:33,131 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 2439 ImplicationChecksByTransitivity, 84.3s TimeCoverageRelationStatistics Valid=748, Invalid=9233, Unknown=139, NotChecked=1010, Total=11130 [2022-11-16 11:57:33,132 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 682 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 2347 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 2410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:57:33,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 1118 Invalid, 2410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2347 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2022-11-16 11:57:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-16 11:57:33,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 82. [2022-11-16 11:57:33,135 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-11-16 11:57:33,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2022-11-16 11:57:33,136 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 59 [2022-11-16 11:57:33,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:57:33,136 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2022-11-16 11:57:33,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 66 states have (on average 1.5151515151515151) internal successors, (100), 61 states have internal predecessors, (100), 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-11-16 11:57:33,137 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2022-11-16 11:57:33,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 11:57:33,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:57:33,138 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-11-16 11:57:33,146 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:57:33,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:33,346 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 11:57:33,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:57:33,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535007, now seen corresponding path program 1 times [2022-11-16 11:57:33,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:57:33,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161091132] [2022-11-16 11:57:33,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:33,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:57:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:41,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:57:41,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:42,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:57:42,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:43,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:57:43,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 7 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:57:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:57:45,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161091132] [2022-11-16 11:57:45,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161091132] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:57:45,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252811271] [2022-11-16 11:57:45,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:57:45,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:57:45,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:57:45,793 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:57:45,795 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:57:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:57:46,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-16 11:57:46,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:57:46,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:57:46,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:57:47,652 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:57:47,652 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-11-16 11:57:48,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:57:49,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:49,947 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:57:49,947 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-11-16 11:57:51,175 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-11-16 11:57:52,057 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:57:52,057 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-11-16 11:57:53,441 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:57:53,441 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-11-16 11:57:54,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:54,127 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-11-16 11:57:55,497 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:57:55,498 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-11-16 11:57:55,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:55,518 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-11-16 11:57:55,532 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-11-16 11:57:58,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:58,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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:57:58,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:58,868 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:57:58,868 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-11-16 11:57:58,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:58,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:57:59,133 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-16 11:57:59,134 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-11-16 11:58:05,422 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-16 11:58:05,423 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-11-16 11:58:05,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:05,556 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-11-16 11:58:06,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:06,294 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-11-16 11:58:06,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:06,377 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:58:06,377 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-11-16 11:58:06,649 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:58:06,650 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-11-16 11:58:06,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:58:06,742 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-11-16 11:58:07,488 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:58:07,488 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-11-16 11:58:07,526 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-11-16 11:58:08,426 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-11-16 11:58:10,116 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:58:10,116 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-11-16 11:58:11,683 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 16 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:58:11,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:58:13,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (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_5935) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5938))) (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_5936) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-16 11:58:15,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (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_5935) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5938))) (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_5931) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5936) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-16 11:58:15,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (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_5935) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5938))) (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_5931) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5936) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 1)) is different from false [2022-11-16 11:58:15,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |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_~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_5935) .cse1 v_ArrVal_5938))) (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_5931) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5936) .cse1 v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) 1)) is different from false [2022-11-16 11:58:19,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (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_5935) .cse2 v_ArrVal_5938))) (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_5931) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5936) .cse2 v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) 1)) is different from false [2022-11-16 11:58:22,204 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5937 (Array Int Int))) (= (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_~new_node~0#1.base|)) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5935) .cse4 v_ArrVal_5938))) (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_5931) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_5936) .cse4 v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) 1)) is different from false [2022-11-16 11:58:26,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| Int) (v_ArrVal_5931 (Array Int Int)) (v_ArrVal_5936 (Array Int Int)) (v_ArrVal_5935 (Array Int Int)) (v_ArrVal_5949 (Array Int Int)) (v_ArrVal_5938 (Array Int Int)) (v_ArrVal_5948 (Array Int Int)) (v_ArrVal_5937 (Array Int Int))) (or (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| |c_#StackHeapBarrier|)) (= (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_5949))) (let ((.cse6 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5948)) (.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_5935) .cse5 v_ArrVal_5938))) (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_5931) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34| v_ArrVal_5936) .cse5 v_ArrVal_5937) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_34|) 0)))) is different from false [2022-11-16 11:58:26,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252811271] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:58:26,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:58:26,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 35] total 70 [2022-11-16 11:58:26,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378298305] [2022-11-16 11:58:26,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:58:26,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-16 11:58:26,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:58:26,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-16 11:58:26,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=4987, Unknown=168, NotChecked=1050, Total=6480 [2022-11-16 11:58:26,713 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-11-16 11:58:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:58:42,018 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-11-16 11:58:42,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-16 11:58:42,019 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-11-16 11:58:42,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:58:42,020 INFO L225 Difference]: With dead ends: 86 [2022-11-16 11:58:42,020 INFO L226 Difference]: Without dead ends: 86 [2022-11-16 11:58:42,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 92 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1542 ImplicationChecksByTransitivity, 48.4s TimeCoverageRelationStatistics Valid=422, Invalid=6905, Unknown=183, NotChecked=1232, Total=8742 [2022-11-16 11:58:42,022 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 61 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:58:42,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1136 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1604 Invalid, 0 Unknown, 65 Unchecked, 8.1s Time] [2022-11-16 11:58:42,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-16 11:58:42,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-11-16 11:58:42,025 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-11-16 11:58:42,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 93 transitions. [2022-11-16 11:58:42,026 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 93 transitions. Word has length 63 [2022-11-16 11:58:42,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:58:42,027 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 93 transitions. [2022-11-16 11:58:42,027 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-11-16 11:58:42,027 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 93 transitions. [2022-11-16 11:58:42,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 11:58:42,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:58:42,028 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-11-16 11:58:42,035 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-11-16 11:58:42,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-16 11:58:42,231 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 11:58:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:58:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1760535006, now seen corresponding path program 1 times [2022-11-16 11:58:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:58:42,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43160327] [2022-11-16 11:58:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:42,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:58:42,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:51,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:58:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:52,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 11:58:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 11:58:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:55,820 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 11:58:55,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:58:55,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43160327] [2022-11-16 11:58:55,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43160327] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:58:55,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836284287] [2022-11-16 11:58:55,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:58:55,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:58:55,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:58:55,822 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:58:55,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:58:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:58:56,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 152 conjunts are in the unsatisfiable core [2022-11-16 11:58:56,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:58:56,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:58:56,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 11:58:57,766 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:58:57,766 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-11-16 11:58:58,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 11:58:59,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:00,019 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 11:59:00,019 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-11-16 11:59:01,301 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-11-16 11:59:02,089 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:59:02,090 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-11-16 11:59:03,559 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 11:59:03,560 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-11-16 11:59:04,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:04,178 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-11-16 11:59:05,611 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 11:59:05,611 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-11-16 11:59:05,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:05,632 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-11-16 11:59:05,646 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-11-16 11:59:06,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 11:59:09,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:09,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 11:59:09,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:09,484 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:59:09,484 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-11-16 11:59:09,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:09,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:09,654 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 11:59:09,655 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-11-16 11:59:15,612 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-16 11:59:15,612 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-11-16 11:59:15,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:15,658 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-11-16 11:59:16,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:16,490 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:59:16,491 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-11-16 11:59:16,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:16,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:16,529 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-11-16 11:59:16,797 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 11:59:16,797 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 111 treesize of output 84 [2022-11-16 11:59:16,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:16,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:16,851 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 33 treesize of output 38 [2022-11-16 11:59:17,681 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 11:59:17,682 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 89 treesize of output 71 [2022-11-16 11:59:17,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:17,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-11-16 11:59:20,349 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-16 11:59:20,350 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 93 treesize of output 47 [2022-11-16 11:59:21,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 11:59:21,905 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 11:59:21,905 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 26 treesize of output 16 [2022-11-16 11:59:22,613 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 11:59:22,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:59:26,049 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_6254 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6254))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6255 (Array Int Int))) (<= 0 (+ (select (select .cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6255) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1) 8))) (not (<= 0 .cse1)))))) (forall ((v_ArrVal_6254 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6254))) (let ((.cse4 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6255 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6255))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse2 .cse3) .cse4) 12) (select |c_#length| (select (select .cse5 .cse3) .cse4)))))) (not (<= 0 .cse4))))))) is different from false [2022-11-16 11:59:33,763 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse5 (select .cse9 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (and (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) .cse5 v_ArrVal_6254))) (let ((.cse2 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6255 (Array Int Int))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) .cse5 v_ArrVal_6255))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse0 .cse1) .cse2) 12) (select |c_#length| (select (select .cse3 .cse1) .cse2)))))) (not (<= 0 .cse2)))))) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse7 (store (store .cse6 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) .cse5 v_ArrVal_6254))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_ArrVal_6255 (Array Int Int))) (<= 0 (+ (select (select .cse7 (select (select (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) .cse5 v_ArrVal_6255) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse8) 8))) (not (<= 0 .cse8))))))))) is different from false [2022-11-16 11:59:35,486 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse11 (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 ((.cse9 (select |c_#memory_$Pointer$.base| .cse11)) (.cse10 (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 (store |c_#memory_$Pointer$.base| .cse11 (store .cse9 .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base|))) (.cse4 (store |c_#memory_$Pointer$.offset| .cse11 (store (select |c_#memory_$Pointer$.offset| .cse11) .cse10 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offset|))) (.cse3 (select .cse9 .cse10))) (and (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) .cse3 v_ArrVal_6254))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse0)) (forall ((v_ArrVal_6255 (Array Int Int))) (<= 0 (+ (select (select .cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) .cse3 v_ArrVal_6255) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse0) 8))))))) (forall ((v_ArrVal_6254 (Array Int Int)) (v_ArrVal_6253 (Array Int Int)) (v_ArrVal_6252 (Array Int Int))) (let ((.cse6 (store (store .cse4 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6252) .cse3 v_ArrVal_6254))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (<= 0 .cse5)) (forall ((v_ArrVal_6255 (Array Int Int))) (let ((.cse8 (store (store .cse2 |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6253) .cse3 v_ArrVal_6255))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (<= (+ (select (select .cse6 .cse7) .cse5) 12) (select |c_#length| (select (select .cse8 .cse7) .cse5)))))))))))))) is different from false [2022-11-16 11:59:37,934 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 1357 treesize of output 1157 [2022-11-16 11:59:40,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836284287] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:59:40,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:59:40,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 71 [2022-11-16 11:59:40,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376098435] [2022-11-16 11:59:40,771 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:59:40,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-11-16 11:59:40,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:59:40,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-11-16 11:59:40,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=6623, Unknown=83, NotChecked=498, Total=7482 [2022-11-16 11:59:40,774 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) [2022-11-16 12:00:16,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:00:16,587 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-11-16 12:00:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-16 12:00:16,588 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 63 [2022-11-16 12:00:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:00:16,589 INFO L225 Difference]: With dead ends: 119 [2022-11-16 12:00:16,589 INFO L226 Difference]: Without dead ends: 119 [2022-11-16 12:00:16,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 104 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 68.9s TimeCoverageRelationStatistics Valid=670, Invalid=9765, Unknown=83, NotChecked=612, Total=11130 [2022-11-16 12:00:16,591 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 312 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 2179 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 2370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:00:16,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 1491 Invalid, 2370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2179 Invalid, 0 Unknown, 116 Unchecked, 12.1s Time] [2022-11-16 12:00:16,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-16 12:00:16,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2022-11-16 12:00:16,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 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-11-16 12:00:16,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-16 12:00:16,596 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 63 [2022-11-16 12:00:16,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:00:16,596 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-16 12:00:16,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2022-11-16 12:00:16,597 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-16 12:00:16,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-16 12:00:16,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:00:16,598 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, 1] [2022-11-16 12:00:16,608 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 12:00:16,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:00:16,808 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 12:00:16,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:00:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1257988692, now seen corresponding path program 1 times [2022-11-16 12:00:16,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:00:16,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625711384] [2022-11-16 12:00:16,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:16,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:00:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:25,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:00:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:26,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:00:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:27,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:00:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:00:30,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:00:30,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625711384] [2022-11-16 12:00:30,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625711384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:30,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883459127] [2022-11-16 12:00:30,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:00:30,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:00:30,000 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:00:30,001 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:00:30,004 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 12:00:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:00:30,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-16 12:00:30,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:00:30,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:00:30,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:00:32,120 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:00:32,120 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-11-16 12:00:33,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:00:34,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:34,608 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:00:34,609 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-11-16 12:00:35,995 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-11-16 12:00:36,927 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:00:36,928 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-11-16 12:00:38,399 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:00:38,399 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-11-16 12:00:39,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:39,049 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-11-16 12:00:40,501 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:00:40,501 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-11-16 12:00:40,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:40,523 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-11-16 12:00:40,537 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-11-16 12:00:43,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:43,234 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 11 [2022-11-16 12:00:43,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:43,317 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-16 12:00:43,318 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-11-16 12:00:43,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:43,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:43,467 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 12:00:43,468 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-11-16 12:00:48,720 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-16 12:00:48,721 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 106 treesize of output 62 [2022-11-16 12:00:48,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:48,765 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-11-16 12:00:49,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:49,508 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:00:49,509 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 43 treesize of output 45 [2022-11-16 12:00:49,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:49,575 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-11-16 12:00:49,757 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:00:49,757 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 87 treesize of output 68 [2022-11-16 12:00:49,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:00:49,799 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-11-16 12:00:50,495 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:00:50,496 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 65 treesize of output 55 [2022-11-16 12:00:50,522 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-11-16 12:00:51,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-16 12:00:53,821 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:00:53,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 24 [2022-11-16 12:00:53,835 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:00:53,835 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:00:54,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (Array Int Int))) (not (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6570) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6572))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-16 12:00:55,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (Array Int Int))) (not (let ((.cse1 (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_6570) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6572))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_6564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-11-16 12:00:55,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (Array Int Int))) (not (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_6570) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6572))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_6564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) |c_ULTIMATE.start_dll_circular_insert_#t~mem11#1.base| v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))) is different from false [2022-11-16 12:00:55,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (Array Int Int))) (not (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|) |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse1 (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_6570) .cse2 v_ArrVal_6572))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.base| v_ArrVal_6564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) .cse2 v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-16 12:00:55,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (Array Int Int))) (not (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_insert_~last~1#1.offset|))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| (store .cse3 |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_6570) .cse2 v_ArrVal_6572))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6564) |c_ULTIMATE.start_dll_circular_insert_~new_node~0#1.base| v_ArrVal_6569) .cse2 v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-11-16 12:00:57,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6570 (Array Int Int))) (not (let ((.cse2 (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 ((.cse4 (select |c_#memory_$Pointer$.base| .cse2)) (.cse5 (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 ((.cse3 (select .cse4 .cse5))) (let ((.cse0 (store (store (store |c_#memory_$Pointer$.base| .cse2 (store .cse4 .cse5 |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6570) .cse3 v_ArrVal_6572))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select .cse0 .cse1) (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_6564) |c_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base| v_ArrVal_6569) .cse3 v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1)))))))) is different from false [2022-11-16 12:00:58,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6572 (Array Int Int)) (v_ArrVal_6564 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| Int) (v_ArrVal_6569 (Array Int Int)) (v_ArrVal_6582 (Array Int Int)) (v_ArrVal_6571 (Array Int Int)) (v_ArrVal_6581 (Array Int Int)) (v_ArrVal_6570 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40|) 0)) (not (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6581))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6582)) (.cse3 (select (select .cse5 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse6 (select .cse5 .cse3)) (.cse7 (select (select .cse2 |c_ULTIMATE.start_dll_circular_insert_~head#1.base|) |c_ULTIMATE.start_dll_circular_insert_~head#1.offset|))) (let ((.cse4 (select .cse6 .cse7))) (let ((.cse1 (store (store (store .cse5 .cse3 (store .cse6 .cse7 |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40|)) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6570) .cse4 v_ArrVal_6572))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store (store (store .cse2 .cse3 v_ArrVal_6564) |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| v_ArrVal_6569) .cse4 v_ArrVal_6571) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (not (< |v_ULTIMATE.start_dll_circular_insert_#t~ret9#1.base_40| |c_#StackHeapBarrier|)))) is different from false [2022-11-16 12:00:58,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883459127] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:00:58,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 12:00:58,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37] total 70 [2022-11-16 12:00:58,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525758295] [2022-11-16 12:00:58,322 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 12:00:58,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-11-16 12:00:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:00:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-11-16 12:00:58,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=4892, Unknown=129, NotChecked=1036, Total=6320 [2022-11-16 12:00:58,325 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 70 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 61 states have internal predecessors, (107), 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-11-16 12:01:30,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:01:30,517 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-11-16 12:01:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-11-16 12:01:30,517 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 61 states have internal predecessors, (107), 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 64 [2022-11-16 12:01:30,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:01:30,518 INFO L225 Difference]: With dead ends: 109 [2022-11-16 12:01:30,518 INFO L226 Difference]: Without dead ends: 109 [2022-11-16 12:01:30,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 51.1s TimeCoverageRelationStatistics Valid=698, Invalid=7941, Unknown=131, NotChecked=1330, Total=10100 [2022-11-16 12:01:30,520 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 942 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 2355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:01:30,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1186 Invalid, 2355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 11.9s Time] [2022-11-16 12:01:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-16 12:01:30,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2022-11-16 12:01:30,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 83 states have internal predecessors, (88), 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-11-16 12:01:30,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-16 12:01:30,524 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 64 [2022-11-16 12:01:30,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:01:30,525 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-16 12:01:30,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 67 states have (on average 1.5970149253731343) internal successors, (107), 61 states have internal predecessors, (107), 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-11-16 12:01:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-16 12:01:30,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-16 12:01:30,526 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:01:30,526 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:01:30,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 12:01:30,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-16 12:01:30,735 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-16 12:01:30,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:01:30,736 INFO L85 PathProgramCache]: Analyzing trace with hash 342976484, now seen corresponding path program 1 times [2022-11-16 12:01:30,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:01:30,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227508898] [2022-11-16 12:01:30,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:30,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:01:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:45,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:01:45,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:47,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:01:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:48,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-16 12:01:48,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-16 12:01:51,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:01:51,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227508898] [2022-11-16 12:01:51,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227508898] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 12:01:51,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098160387] [2022-11-16 12:01:51,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:01:51,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 12:01:51,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:01:51,759 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 12:01:51,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc1bdbe-8e76-4734-8a8f-5a80de324e3b/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 12:01:52,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:01:52,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 168 conjunts are in the unsatisfiable core [2022-11-16 12:01:52,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 12:01:52,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-16 12:01:52,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-16 12:01:54,549 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:01:54,549 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-11-16 12:01:55,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-16 12:01:57,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:01:57,350 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-16 12:01:57,351 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-11-16 12:01:58,967 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-11-16 12:01:59,932 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:01:59,932 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-11-16 12:02:01,661 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-16 12:02:01,661 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-11-16 12:02:02,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:02,465 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-11-16 12:02:04,217 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-16 12:02:04,217 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-11-16 12:02:04,234 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-11-16 12:02:04,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:04,254 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-11-16 12:02:06,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-16 12:02:08,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:08,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-16 12:02:08,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:08,560 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:02:08,560 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-11-16 12:02:08,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:08,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:08,753 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-16 12:02:08,753 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-11-16 12:02:16,035 INFO L321 Elim1Store]: treesize reduction 32, result has 25.6 percent of original size [2022-11-16 12:02:16,035 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 129 treesize of output 77 [2022-11-16 12:02:16,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:16,059 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-11-16 12:02:16,177 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 20 treesize of output 22 [2022-11-16 12:02:17,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:17,159 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:02:17,160 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-11-16 12:02:17,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:17,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:17,197 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-11-16 12:02:17,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:17,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-16 12:02:17,509 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-16 12:02:17,509 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 161 treesize of output 118 [2022-11-16 12:02:17,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:17,569 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 53 treesize of output 44 [2022-11-16 12:02:17,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:17,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:17,597 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 44 treesize of output 43 [2022-11-16 12:02:18,691 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-16 12:02:18,692 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 104 treesize of output 84 [2022-11-16 12:02:18,728 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 24 treesize of output 26 [2022-11-16 12:02:18,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:18,758 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 36 treesize of output 35 [2022-11-16 12:02:22,070 INFO L321 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-11-16 12:02:22,071 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 108 treesize of output 58 [2022-11-16 12:02:22,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-16 12:02:22,140 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-16 12:02:22,140 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 33 treesize of output 19 [2022-11-16 12:02:23,941 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-16 12:02:23,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:02:23,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-11-16 12:02:24,618 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-16 12:02:24,618 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 12:02:28,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_6894 (Array Int Int)) (v_ArrVal_6893 (Array Int Int)) (v_ArrVal_6895 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6893)) (.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6894))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_insert_~last~1#1.base| v_ArrVal_6895) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 8)))))) is different from false [2022-11-16 12:02:41,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:02:41,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 482 treesize of output 473 [2022-11-16 12:02:41,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:02:41,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20178 treesize of output 19574 [2022-11-16 12:02:41,837 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 24284 treesize of output 22668 [2022-11-16 12:02:41,910 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 22668 treesize of output 19436 [2022-11-16 12:02:44,903 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 1907 treesize of output 1503 [2022-11-16 12:03:23,353 WARN L233 SmtUtils]: Spent 37.99s on a formula simplification that was a NOOP. DAG size: 171 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-16 12:03:23,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-16 12:03:23,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 8726 treesize of output 10556