./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_update_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8393723b 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_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_update_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro --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 c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 --- 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-8393723 [2022-11-18 19:53:40,331 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 19:53:40,333 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 19:53:40,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 19:53:40,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 19:53:40,374 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 19:53:40,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 19:53:40,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 19:53:40,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 19:53:40,396 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 19:53:40,399 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 19:53:40,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 19:53:40,402 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 19:53:40,405 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 19:53:40,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 19:53:40,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 19:53:40,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 19:53:40,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 19:53:40,412 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 19:53:40,414 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 19:53:40,416 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 19:53:40,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 19:53:40,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 19:53:40,420 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 19:53:40,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 19:53:40,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 19:53:40,426 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 19:53:40,427 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 19:53:40,427 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 19:53:40,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 19:53:40,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 19:53:40,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 19:53:40,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 19:53:40,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 19:53:40,434 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 19:53:40,434 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 19:53:40,435 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 19:53:40,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 19:53:40,436 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 19:53:40,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 19:53:40,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 19:53:40,439 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-18 19:53:40,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 19:53:40,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 19:53:40,491 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 19:53:40,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 19:53:40,492 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 19:53:40,492 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 19:53:40,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 19:53:40,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 19:53:40,494 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 19:53:40,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 19:53:40,494 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 19:53:40,498 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-18 19:53:40,498 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 19:53:40,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 19:53:40,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 19:53:40,499 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-18 19:53:40,499 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-18 19:53:40,500 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-18 19:53:40,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 19:53:40,500 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-18 19:53:40,500 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 19:53:40,501 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 19:53:40,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 19:53:40,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 19:53:40,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 19:53:40,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:53:40,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 19:53:40,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 19:53:40,506 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 19:53:40,506 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 19:53:40,506 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_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/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_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro 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 -> c46cc56772f2c3f0b073640343b328fb3b128ed13803ffe5a04f6290fe624494 [2022-11-18 19:53:40,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 19:53:40,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 19:53:40,913 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 19:53:40,916 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 19:53:40,917 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 19:53:40,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-18 19:53:41,004 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/data/08f0c67b4/88f312c06982487086e16d56be3dfeda/FLAG277d54efd [2022-11-18 19:53:41,768 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 19:53:41,769 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/sv-benchmarks/c/list-simple/dll2n_update_all.i [2022-11-18 19:53:41,788 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/data/08f0c67b4/88f312c06982487086e16d56be3dfeda/FLAG277d54efd [2022-11-18 19:53:41,916 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/data/08f0c67b4/88f312c06982487086e16d56be3dfeda [2022-11-18 19:53:41,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 19:53:41,921 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 19:53:41,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 19:53:41,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 19:53:41,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 19:53:41,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:53:41" (1/1) ... [2022-11-18 19:53:41,930 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4457d0c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:41, skipping insertion in model container [2022-11-18 19:53:41,931 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 07:53:41" (1/1) ... [2022-11-18 19:53:41,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 19:53:42,010 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 19:53:42,517 WARN L234 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_da64d683-5a97-4905-aead-d5cbb8ffbad4/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-18 19:53:42,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:53:42,540 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 19:53:42,630 WARN L234 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_da64d683-5a97-4905-aead-d5cbb8ffbad4/sv-benchmarks/c/list-simple/dll2n_update_all.i[24455,24468] [2022-11-18 19:53:42,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 19:53:42,661 INFO L208 MainTranslator]: Completed translation [2022-11-18 19:53:42,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42 WrapperNode [2022-11-18 19:53:42,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 19:53:42,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 19:53:42,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 19:53:42,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 19:53:42,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,690 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,717 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2022-11-18 19:53:42,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 19:53:42,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 19:53:42,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 19:53:42,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 19:53:42,730 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,735 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,735 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,750 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,755 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 19:53:42,756 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 19:53:42,756 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 19:53:42,756 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 19:53:42,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (1/1) ... [2022-11-18 19:53:42,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 19:53:42,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:42,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 19:53:42,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 19:53:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-18 19:53:42,875 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-18 19:53:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-18 19:53:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 19:53:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-18 19:53:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 19:53:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-18 19:53:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-18 19:53:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 19:53:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 19:53:42,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 19:53:42,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 19:53:43,066 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 19:53:43,069 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 19:53:43,118 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-18 19:53:43,462 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 19:53:43,470 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 19:53:43,483 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-18 19:53:43,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:53:43 BoogieIcfgContainer [2022-11-18 19:53:43,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 19:53:43,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 19:53:43,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 19:53:43,505 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 19:53:43,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 07:53:41" (1/3) ... [2022-11-18 19:53:43,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768554b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:53:43, skipping insertion in model container [2022-11-18 19:53:43,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 07:53:42" (2/3) ... [2022-11-18 19:53:43,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768554b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 07:53:43, skipping insertion in model container [2022-11-18 19:53:43,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 07:53:43" (3/3) ... [2022-11-18 19:53:43,510 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_update_all.i [2022-11-18 19:53:43,541 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 19:53:43,542 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-11-18 19:53:43,628 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 19:53:43,639 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;@51c5204d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 19:53:43,640 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-11-18 19:53:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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-18 19:53:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 19:53:43,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:43,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 19:53:43,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:43,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:43,670 INFO L85 PathProgramCache]: Analyzing trace with hash 33471376, now seen corresponding path program 1 times [2022-11-18 19:53:43,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:43,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184032160] [2022-11-18 19:53:43,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:43,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:43,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:44,104 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-18 19:53:44,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:44,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184032160] [2022-11-18 19:53:44,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184032160] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:44,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:44,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:53:44,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712432698] [2022-11-18 19:53:44,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:44,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:53:44,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:44,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:53:44,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:53:44,177 INFO L87 Difference]: Start difference. First operand has 67 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 65 states have internal predecessors, (80), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:44,398 INFO L93 Difference]: Finished difference Result 111 states and 123 transitions. [2022-11-18 19:53:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:53:44,402 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 19:53:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:44,414 INFO L225 Difference]: With dead ends: 111 [2022-11-18 19:53:44,414 INFO L226 Difference]: Without dead ends: 104 [2022-11-18 19:53:44,417 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-18 19:53:44,421 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 63 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:44,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 136 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:53:44,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-18 19:53:44,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 59. [2022-11-18 19:53:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.6666666666666667) internal successors, (65), 58 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2022-11-18 19:53:44,480 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 5 [2022-11-18 19:53:44,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:44,481 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2022-11-18 19:53:44,481 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:44,481 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-11-18 19:53:44,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-18 19:53:44,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:44,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-18 19:53:44,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 19:53:44,483 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:44,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:44,484 INFO L85 PathProgramCache]: Analyzing trace with hash 33471377, now seen corresponding path program 1 times [2022-11-18 19:53:44,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:44,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103402456] [2022-11-18 19:53:44,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:44,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:44,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:44,673 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-18 19:53:44,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:44,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103402456] [2022-11-18 19:53:44,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103402456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:44,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:44,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 19:53:44,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694912877] [2022-11-18 19:53:44,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:44,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:53:44,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:44,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:53:44,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:53:44,691 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:44,850 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2022-11-18 19:53:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:53:44,851 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-18 19:53:44,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:44,852 INFO L225 Difference]: With dead ends: 101 [2022-11-18 19:53:44,853 INFO L226 Difference]: Without dead ends: 101 [2022-11-18 19:53:44,853 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-18 19:53:44,855 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 58 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:44,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 133 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:53:44,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-11-18 19:53:44,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 56. [2022-11-18 19:53:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 55 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:44,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 62 transitions. [2022-11-18 19:53:44,878 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 62 transitions. Word has length 5 [2022-11-18 19:53:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:44,879 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 62 transitions. [2022-11-18 19:53:44,879 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 62 transitions. [2022-11-18 19:53:44,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-18 19:53:44,881 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:44,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:44,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 19:53:44,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:44,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:44,883 INFO L85 PathProgramCache]: Analyzing trace with hash 678997037, now seen corresponding path program 1 times [2022-11-18 19:53:44,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:44,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242015994] [2022-11-18 19:53:44,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:44,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:44,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:44,962 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-18 19:53:44,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:44,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242015994] [2022-11-18 19:53:44,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242015994] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:44,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:44,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:53:44,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420019910] [2022-11-18 19:53:44,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:44,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:53:44,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:44,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:53:44,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:53:44,967 INFO L87 Difference]: Start difference. First operand 56 states and 62 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:44,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:44,984 INFO L93 Difference]: Finished difference Result 66 states and 73 transitions. [2022-11-18 19:53:44,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:53:44,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-18 19:53:44,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:44,987 INFO L225 Difference]: With dead ends: 66 [2022-11-18 19:53:44,987 INFO L226 Difference]: Without dead ends: 66 [2022-11-18 19:53:44,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 19:53:44,989 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:44,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:53:44,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-18 19:53:44,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2022-11-18 19:53:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.575) internal successors, (63), 56 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2022-11-18 19:53:44,999 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 8 [2022-11-18 19:53:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:44,999 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2022-11-18 19:53:45,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-11-18 19:53:45,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-18 19:53:45,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:45,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:45,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 19:53:45,002 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:45,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:45,003 INFO L85 PathProgramCache]: Analyzing trace with hash 638916372, now seen corresponding path program 1 times [2022-11-18 19:53:45,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:45,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397270057] [2022-11-18 19:53:45,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:45,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:45,113 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-18 19:53:45,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:45,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397270057] [2022-11-18 19:53:45,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397270057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:45,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:45,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-18 19:53:45,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098430467] [2022-11-18 19:53:45,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:45,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 19:53:45,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:45,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 19:53:45,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 19:53:45,118 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:45,145 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-11-18 19:53:45,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 19:53:45,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-18 19:53:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:45,148 INFO L225 Difference]: With dead ends: 63 [2022-11-18 19:53:45,148 INFO L226 Difference]: Without dead ends: 63 [2022-11-18 19:53:45,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-18 19:53:45,150 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 1 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:45,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 113 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:53:45,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-18 19:53:45,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-11-18 19:53:45,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.511111111111111) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:45,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-18 19:53:45,160 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2022-11-18 19:53:45,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:45,161 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-18 19:53:45,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:45,161 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-18 19:53:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-18 19:53:45,162 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:45,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:45,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 19:53:45,163 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:45,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:45,164 INFO L85 PathProgramCache]: Analyzing trace with hash 2114731710, now seen corresponding path program 1 times [2022-11-18 19:53:45,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:45,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458183257] [2022-11-18 19:53:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:45,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:45,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:45,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:45,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458183257] [2022-11-18 19:53:45,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458183257] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:53:45,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368109903] [2022-11-18 19:53:45,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:45,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:45,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:45,428 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:53:45,461 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-18 19:53:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:45,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:53:45,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:53:45,665 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:45,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:53:45,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:45,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368109903] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:53:45,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:53:45,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-18 19:53:45,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77988307] [2022-11-18 19:53:45,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:53:45,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:53:45,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:45,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:53:45,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:53:45,740 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:45,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:45,778 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-11-18 19:53:45,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:53:45,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-18 19:53:45,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:45,788 INFO L225 Difference]: With dead ends: 64 [2022-11-18 19:53:45,789 INFO L226 Difference]: Without dead ends: 64 [2022-11-18 19:53:45,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:53:45,791 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:45,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 167 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:53:45,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-18 19:53:45,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-18 19:53:45,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:45,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-18 19:53:45,798 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 15 [2022-11-18 19:53:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:45,799 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-18 19:53:45,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-18 19:53:45,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:53:45,807 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:45,807 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:45,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-18 19:53:46,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:46,015 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:46,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:46,016 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949021, now seen corresponding path program 1 times [2022-11-18 19:53:46,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:46,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600288803] [2022-11-18 19:53:46,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:46,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:46,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:46,394 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:46,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600288803] [2022-11-18 19:53:46,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600288803] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:53:46,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26682165] [2022-11-18 19:53:46,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:46,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:46,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:46,400 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:53:46,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-18 19:53:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:46,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-18 19:53:46,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:53:46,589 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-18 19:53:46,652 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-18 19:53:46,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-18 19:53:46,683 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:46,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:53:46,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:46,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [26682165] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:53:46,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:53:46,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-18 19:53:46,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355270115] [2022-11-18 19:53:46,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:53:46,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:53:46,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:46,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:53:46,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:53:46,869 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:47,026 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2022-11-18 19:53:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:53:47,027 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 19:53:47,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:47,029 INFO L225 Difference]: With dead ends: 77 [2022-11-18 19:53:47,029 INFO L226 Difference]: Without dead ends: 77 [2022-11-18 19:53:47,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-18 19:53:47,031 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 266 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:47,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 66 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 23 Unchecked, 0.1s Time] [2022-11-18 19:53:47,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-18 19:53:47,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 63. [2022-11-18 19:53:47,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 47 states have (on average 1.4680851063829787) internal successors, (69), 62 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:47,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 69 transitions. [2022-11-18 19:53:47,039 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 69 transitions. Word has length 16 [2022-11-18 19:53:47,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:47,040 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 69 transitions. [2022-11-18 19:53:47,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:47,040 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 69 transitions. [2022-11-18 19:53:47,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-18 19:53:47,041 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:47,041 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:47,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-18 19:53:47,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-18 19:53:47,248 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:47,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:47,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2097949020, now seen corresponding path program 1 times [2022-11-18 19:53:47,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:47,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058082458] [2022-11-18 19:53:47,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:47,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:47,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058082458] [2022-11-18 19:53:47,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058082458] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:53:47,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042760900] [2022-11-18 19:53:47,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:47,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:47,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:47,637 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:53:47,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-18 19:53:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:47,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-18 19:53:47,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:53:47,835 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-18 19:53:47,850 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-18 19:53:47,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:53:47,960 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-18 19:53:47,984 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:53:47,984 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-18 19:53:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:48,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:53:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:54,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042760900] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:53:54,541 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:53:54,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2022-11-18 19:53:54,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493776908] [2022-11-18 19:53:54,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:53:54,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:53:54,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:54,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:53:54,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:53:54,545 INFO L87 Difference]: Start difference. First operand 63 states and 69 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:54,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:54,716 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2022-11-18 19:53:54,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:53:54,720 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-18 19:53:54,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:54,721 INFO L225 Difference]: With dead ends: 76 [2022-11-18 19:53:54,721 INFO L226 Difference]: Without dead ends: 76 [2022-11-18 19:53:54,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-18 19:53:54,722 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 296 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:54,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 67 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 24 Unchecked, 0.1s Time] [2022-11-18 19:53:54,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-18 19:53:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-11-18 19:53:54,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 47 states have (on average 1.446808510638298) internal successors, (68), 61 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:54,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2022-11-18 19:53:54,730 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 16 [2022-11-18 19:53:54,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:54,731 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2022-11-18 19:53:54,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:54,731 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2022-11-18 19:53:54,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 19:53:54,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:54,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:54,743 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-18 19:53:54,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:54,939 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:54,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969267, now seen corresponding path program 2 times [2022-11-18 19:53:54,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:54,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9626744] [2022-11-18 19:53:54,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:54,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:55,028 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:55,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:55,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9626744] [2022-11-18 19:53:55,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9626744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:53:55,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062237740] [2022-11-18 19:53:55,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:53:55,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:55,030 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:55,031 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:53:55,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-18 19:53:55,147 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-18 19:53:55,147 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:53:55,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:53:55,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:53:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 19:53:55,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:53:55,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062237740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:55,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:53:55,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2022-11-18 19:53:55,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22085389] [2022-11-18 19:53:55,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:55,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:53:55,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:55,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:53:55,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:53:55,174 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:55,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:55,227 INFO L93 Difference]: Finished difference Result 160 states and 173 transitions. [2022-11-18 19:53:55,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:53:55,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-18 19:53:55,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:55,229 INFO L225 Difference]: With dead ends: 160 [2022-11-18 19:53:55,229 INFO L226 Difference]: Without dead ends: 160 [2022-11-18 19:53:55,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:53:55,231 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 115 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:55,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 212 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:53:55,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-11-18 19:53:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 64. [2022-11-18 19:53:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-11-18 19:53:55,238 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2022-11-18 19:53:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:55,239 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-11-18 19:53:55,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-11-18 19:53:55,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-18 19:53:55,240 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:55,241 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:55,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-18 19:53:55,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:55,447 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:55,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:55,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1891969322, now seen corresponding path program 1 times [2022-11-18 19:53:55,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:55,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107839799] [2022-11-18 19:53:55,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:55,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:55,567 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:55,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:55,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107839799] [2022-11-18 19:53:55,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107839799] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:53:55,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182775280] [2022-11-18 19:53:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:55,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:55,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:55,576 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:53:55,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-18 19:53:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:55,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:53:55,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:53:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:55,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:53:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:53:55,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182775280] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:53:55,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:53:55,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2022-11-18 19:53:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459816598] [2022-11-18 19:53:55,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:53:55,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:53:55,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:55,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:53:55,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:53:55,807 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:55,860 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2022-11-18 19:53:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:53:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-18 19:53:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:55,862 INFO L225 Difference]: With dead ends: 64 [2022-11-18 19:53:55,862 INFO L226 Difference]: Without dead ends: 64 [2022-11-18 19:53:55,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:53:55,866 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 103 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:55,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 56 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:53:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-18 19:53:55,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-18 19:53:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-18 19:53:55,883 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 22 [2022-11-18 19:53:55,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:55,883 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-18 19:53:55,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:55,884 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-18 19:53:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 19:53:55,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:55,885 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:55,899 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-18 19:53:56,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-18 19:53:56,099 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:56,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022437, now seen corresponding path program 1 times [2022-11-18 19:53:56,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:56,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472699821] [2022-11-18 19:53:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:56,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:56,301 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-18 19:53:56,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:56,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472699821] [2022-11-18 19:53:56,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472699821] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:56,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:56,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:53:56,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237424829] [2022-11-18 19:53:56,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:56,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:53:56,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:56,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:53:56,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:53:56,307 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:56,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:56,559 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-18 19:53:56,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:53:56,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-18 19:53:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:56,561 INFO L225 Difference]: With dead ends: 114 [2022-11-18 19:53:56,561 INFO L226 Difference]: Without dead ends: 114 [2022-11-18 19:53:56,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:53:56,562 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 259 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:56,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 123 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:53:56,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-18 19:53:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 67. [2022-11-18 19:53:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 66 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 76 transitions. [2022-11-18 19:53:56,568 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 76 transitions. Word has length 23 [2022-11-18 19:53:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:56,569 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 76 transitions. [2022-11-18 19:53:56,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-11-18 19:53:56,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-18 19:53:56,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:56,571 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:56,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 19:53:56,572 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:56,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:56,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1779022436, now seen corresponding path program 1 times [2022-11-18 19:53:56,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:56,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304305481] [2022-11-18 19:53:56,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:56,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:56,845 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-18 19:53:56,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:56,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304305481] [2022-11-18 19:53:56,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304305481] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:56,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:56,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:53:56,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823085449] [2022-11-18 19:53:56,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:56,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:53:56,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:56,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:53:56,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:53:56,849 INFO L87 Difference]: Start difference. First operand 67 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:57,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:57,100 INFO L93 Difference]: Finished difference Result 102 states and 112 transitions. [2022-11-18 19:53:57,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:53:57,101 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-18 19:53:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:57,102 INFO L225 Difference]: With dead ends: 102 [2022-11-18 19:53:57,102 INFO L226 Difference]: Without dead ends: 102 [2022-11-18 19:53:57,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:53:57,103 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 265 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:57,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 101 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:53:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-18 19:53:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 67. [2022-11-18 19:53:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 66 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:57,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-11-18 19:53:57,107 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 23 [2022-11-18 19:53:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:57,107 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-11-18 19:53:57,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:57,108 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-11-18 19:53:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 19:53:57,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:57,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:57,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 19:53:57,109 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:57,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:57,109 INFO L85 PathProgramCache]: Analyzing trace with hash -244809887, now seen corresponding path program 1 times [2022-11-18 19:53:57,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:57,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730238791] [2022-11-18 19:53:57,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:57,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:57,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:57,265 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-18 19:53:57,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:57,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730238791] [2022-11-18 19:53:57,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730238791] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:57,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:57,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:53:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425511494] [2022-11-18 19:53:57,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:57,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:53:57,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:53:57,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:53:57,269 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:57,488 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-11-18 19:53:57,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:53:57,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-18 19:53:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:57,490 INFO L225 Difference]: With dead ends: 102 [2022-11-18 19:53:57,490 INFO L226 Difference]: Without dead ends: 102 [2022-11-18 19:53:57,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:53:57,491 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:57,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 106 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-18 19:53:57,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-18 19:53:57,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2022-11-18 19:53:57,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 69 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 80 transitions. [2022-11-18 19:53:57,495 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 80 transitions. Word has length 25 [2022-11-18 19:53:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:57,496 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 80 transitions. [2022-11-18 19:53:57,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 80 transitions. [2022-11-18 19:53:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-18 19:53:57,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:57,497 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:57,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 19:53:57,498 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash -244809886, now seen corresponding path program 1 times [2022-11-18 19:53:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:57,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634402401] [2022-11-18 19:53:57,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:57,629 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-18 19:53:57,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:57,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634402401] [2022-11-18 19:53:57,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634402401] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:53:57,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877395438] [2022-11-18 19:53:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:57,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:57,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:57,632 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:53:57,649 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-18 19:53:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:57,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-18 19:53:57,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:53:57,856 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 19:53:57,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:53:57,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877395438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:57,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:53:57,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-18 19:53:57,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255530226] [2022-11-18 19:53:57,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:57,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:53:57,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:57,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:53:57,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:53:57,859 INFO L87 Difference]: Start difference. First operand 70 states and 80 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:57,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:57,882 INFO L93 Difference]: Finished difference Result 91 states and 104 transitions. [2022-11-18 19:53:57,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-18 19:53:57,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-18 19:53:57,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:57,884 INFO L225 Difference]: With dead ends: 91 [2022-11-18 19:53:57,884 INFO L226 Difference]: Without dead ends: 91 [2022-11-18 19:53:57,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:53:57,885 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 87 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:57,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 105 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:53:57,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-18 19:53:57,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 71. [2022-11-18 19:53:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.4285714285714286) internal successors, (80), 70 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2022-11-18 19:53:57,889 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 25 [2022-11-18 19:53:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:57,890 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2022-11-18 19:53:57,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2022-11-18 19:53:57,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-18 19:53:57,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:57,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:57,903 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-18 19:53:58,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-18 19:53:58,098 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:58,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:58,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1962551634, now seen corresponding path program 1 times [2022-11-18 19:53:58,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:58,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267077054] [2022-11-18 19:53:58,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:58,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:58,465 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:53:58,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:58,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267077054] [2022-11-18 19:53:58,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267077054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:53:58,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:53:58,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:53:58,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306883750] [2022-11-18 19:53:58,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:53:58,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:53:58,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:58,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:53:58,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:53:58,468 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:58,698 INFO L93 Difference]: Finished difference Result 94 states and 102 transitions. [2022-11-18 19:53:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:53:58,699 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-18 19:53:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:58,699 INFO L225 Difference]: With dead ends: 94 [2022-11-18 19:53:58,699 INFO L226 Difference]: Without dead ends: 94 [2022-11-18 19:53:58,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:53:58,700 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 324 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:58,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 75 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:53:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-18 19:53:58,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2022-11-18 19:53:58,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 70 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-18 19:53:58,704 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 30 [2022-11-18 19:53:58,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:58,704 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-18 19:53:58,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:58,704 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-18 19:53:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-18 19:53:58,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:58,706 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:58,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-18 19:53:58,707 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:58,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash -669697558, now seen corresponding path program 1 times [2022-11-18 19:53:58,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:58,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091469422] [2022-11-18 19:53:58,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:58,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:58,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 19:53:58,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:53:58,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091469422] [2022-11-18 19:53:58,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091469422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:53:58,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881965028] [2022-11-18 19:53:58,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:58,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:53:58,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:53:58,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:53:58,855 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-18 19:53:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:53:59,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:53:59,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:53:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 19:53:59,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:53:59,102 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 19:53:59,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881965028] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:53:59,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:53:59,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-11-18 19:53:59,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39150830] [2022-11-18 19:53:59,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:53:59,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:53:59,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:53:59,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:53:59,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:53:59,105 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:53:59,193 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2022-11-18 19:53:59,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:53:59,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-18 19:53:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:53:59,196 INFO L225 Difference]: With dead ends: 136 [2022-11-18 19:53:59,196 INFO L226 Difference]: Without dead ends: 136 [2022-11-18 19:53:59,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:53:59,197 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 158 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:53:59,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 232 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:53:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-18 19:53:59,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 79. [2022-11-18 19:53:59,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.375) internal successors, (88), 78 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:59,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2022-11-18 19:53:59,201 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 31 [2022-11-18 19:53:59,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:53:59,201 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2022-11-18 19:53:59,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:53:59,202 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-11-18 19:53:59,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-18 19:53:59,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:53:59,203 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:53:59,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-18 19:53:59,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-18 19:53:59,412 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:53:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:53:59,412 INFO L85 PathProgramCache]: Analyzing trace with hash -669697613, now seen corresponding path program 1 times [2022-11-18 19:53:59,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:53:59,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310069814] [2022-11-18 19:53:59,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:53:59,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:53:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:00,226 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:54:00,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:00,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310069814] [2022-11-18 19:54:00,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310069814] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:00,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523563149] [2022-11-18 19:54:00,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:00,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:00,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:00,232 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:00,259 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-18 19:54:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:00,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-18 19:54:00,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:00,443 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-18 19:54:00,494 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:54:00,495 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-18 19:54:00,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:54:00,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:54:00,588 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:00,588 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 34 treesize of output 35 [2022-11-18 19:54:00,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:00,856 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 29 treesize of output 24 [2022-11-18 19:54:00,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-18 19:54:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:54:00,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:03,708 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-18 19:54:03,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:54:03,718 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-11-18 19:54:03,732 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 Int) (v_ArrVal_886 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_884)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2022-11-18 19:54:03,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:03,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-11-18 19:54:03,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-18 19:54:03,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:54:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2022-11-18 19:54:03,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523563149] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:03,873 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:03,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 31 [2022-11-18 19:54:03,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248912199] [2022-11-18 19:54:03,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:03,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-18 19:54:03,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:03,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-18 19:54:03,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=781, Unknown=3, NotChecked=114, Total=992 [2022-11-18 19:54:03,875 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:05,706 INFO L93 Difference]: Finished difference Result 217 states and 242 transitions. [2022-11-18 19:54:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 19:54:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-18 19:54:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:05,709 INFO L225 Difference]: With dead ends: 217 [2022-11-18 19:54:05,709 INFO L226 Difference]: Without dead ends: 217 [2022-11-18 19:54:05,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=334, Invalid=1833, Unknown=3, NotChecked=182, Total=2352 [2022-11-18 19:54:05,711 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 791 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 791 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 459 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:05,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [791 Valid, 864 Invalid, 1348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 856 Invalid, 0 Unknown, 459 Unchecked, 0.8s Time] [2022-11-18 19:54:05,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-18 19:54:05,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 109. [2022-11-18 19:54:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2022-11-18 19:54:05,718 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 31 [2022-11-18 19:54:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:05,719 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2022-11-18 19:54:05,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2022-11-18 19:54:05,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-18 19:54:05,722 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:05,722 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:05,735 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:05,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-18 19:54:05,930 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:05,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash -669697612, now seen corresponding path program 1 times [2022-11-18 19:54:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:05,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883267709] [2022-11-18 19:54:05,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:05,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:07,311 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:54:07,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:07,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883267709] [2022-11-18 19:54:07,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883267709] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:07,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735557354] [2022-11-18 19:54:07,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:07,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:07,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:07,313 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:07,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-18 19:54:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:07,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-18 19:54:07,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:07,512 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-18 19:54:07,622 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:54:07,622 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-18 19:54:07,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:54:07,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:54:07,872 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:54:07,881 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:54:07,932 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:07,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-18 19:54:07,943 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 41 treesize of output 41 [2022-11-18 19:54:08,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:08,346 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 34 treesize of output 29 [2022-11-18 19:54:08,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:08,355 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 30 [2022-11-18 19:54:08,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-18 19:54:08,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-18 19:54:08,600 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:54:08,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:09,786 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:09,787 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 47 treesize of output 51 [2022-11-18 19:54:10,042 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1001 Int) (v_prenex_1 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1001)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 9))) (forall ((v_ArrVal_1000 Int) (v_ArrVal_1004 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1 v_ArrVal_1000)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1004) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_1001 Int) (v_ArrVal_1003 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 .cse1 v_ArrVal_1001)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1003) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2))))) is different from false [2022-11-18 19:54:10,069 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:10,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-11-18 19:54:10,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-11-18 19:54:10,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:54:10,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:10,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2022-11-18 19:54:10,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:10,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2022-11-18 19:54:10,112 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 19:54:10,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2022-11-18 19:54:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2022-11-18 19:54:10,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735557354] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:10,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:10,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 39 [2022-11-18 19:54:10,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383995302] [2022-11-18 19:54:10,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:10,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-11-18 19:54:10,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:10,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-11-18 19:54:10,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1358, Unknown=12, NotChecked=74, Total=1560 [2022-11-18 19:54:10,445 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 40 states, 39 states have (on average 2.282051282051282) internal successors, (89), 40 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:14,228 INFO L93 Difference]: Finished difference Result 252 states and 279 transitions. [2022-11-18 19:54:14,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-18 19:54:14,228 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.282051282051282) internal successors, (89), 40 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-11-18 19:54:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:14,230 INFO L225 Difference]: With dead ends: 252 [2022-11-18 19:54:14,230 INFO L226 Difference]: Without dead ends: 252 [2022-11-18 19:54:14,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=449, Invalid=2513, Unknown=12, NotChecked=106, Total=3080 [2022-11-18 19:54:14,232 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 2239 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2239 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 346 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:14,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2239 Valid, 885 Invalid, 1295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 910 Invalid, 0 Unknown, 346 Unchecked, 1.0s Time] [2022-11-18 19:54:14,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-18 19:54:14,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 117. [2022-11-18 19:54:14,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 116 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 137 transitions. [2022-11-18 19:54:14,237 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 137 transitions. Word has length 31 [2022-11-18 19:54:14,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:14,238 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 137 transitions. [2022-11-18 19:54:14,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.282051282051282) internal successors, (89), 40 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 137 transitions. [2022-11-18 19:54:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-18 19:54:14,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:14,239 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:14,249 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:14,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-18 19:54:14,444 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:14,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:14,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1015753968, now seen corresponding path program 1 times [2022-11-18 19:54:14,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:14,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251725560] [2022-11-18 19:54:14,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:14,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:14,517 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:54:14,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:14,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251725560] [2022-11-18 19:54:14,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251725560] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:14,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:14,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-18 19:54:14,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115299139] [2022-11-18 19:54:14,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:14,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-18 19:54:14,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:14,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-18 19:54:14,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-18 19:54:14,520 INFO L87 Difference]: Start difference. First operand 117 states and 137 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:14,547 INFO L93 Difference]: Finished difference Result 141 states and 162 transitions. [2022-11-18 19:54:14,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:54:14,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-18 19:54:14,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:14,549 INFO L225 Difference]: With dead ends: 141 [2022-11-18 19:54:14,549 INFO L226 Difference]: Without dead ends: 141 [2022-11-18 19:54:14,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-18 19:54:14,551 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:14,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 161 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:54:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-18 19:54:14,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 118. [2022-11-18 19:54:14,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 103 states have (on average 1.3398058252427185) internal successors, (138), 117 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 138 transitions. [2022-11-18 19:54:14,557 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 138 transitions. Word has length 33 [2022-11-18 19:54:14,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:14,558 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 138 transitions. [2022-11-18 19:54:14,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 138 transitions. [2022-11-18 19:54:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-18 19:54:14,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:14,560 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:14,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-18 19:54:14,560 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:14,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:14,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1373031599, now seen corresponding path program 1 times [2022-11-18 19:54:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:14,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17943825] [2022-11-18 19:54:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:14,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-18 19:54:14,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:14,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17943825] [2022-11-18 19:54:14,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17943825] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:14,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850566031] [2022-11-18 19:54:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:14,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:14,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:14,743 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:14,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-18 19:54:14,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:14,927 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-18 19:54:14,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 19:54:15,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 19:54:15,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850566031] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:15,077 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:15,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2022-11-18 19:54:15,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872729869] [2022-11-18 19:54:15,079 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:15,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 19:54:15,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:15,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 19:54:15,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-18 19:54:15,081 INFO L87 Difference]: Start difference. First operand 118 states and 138 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:15,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:15,142 INFO L93 Difference]: Finished difference Result 151 states and 171 transitions. [2022-11-18 19:54:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:54:15,143 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-18 19:54:15,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:15,144 INFO L225 Difference]: With dead ends: 151 [2022-11-18 19:54:15,144 INFO L226 Difference]: Without dead ends: 151 [2022-11-18 19:54:15,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:54:15,144 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 144 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:15,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 248 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:54:15,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-18 19:54:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 124. [2022-11-18 19:54:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 109 states have (on average 1.311926605504587) internal successors, (143), 123 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:15,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2022-11-18 19:54:15,148 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 34 [2022-11-18 19:54:15,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:15,148 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2022-11-18 19:54:15,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-11-18 19:54:15,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:54:15,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:15,149 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:15,155 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-18 19:54:15,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:15,355 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:15,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:15,355 INFO L85 PathProgramCache]: Analyzing trace with hash -833185593, now seen corresponding path program 2 times [2022-11-18 19:54:15,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:15,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340588975] [2022-11-18 19:54:15,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:15,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:15,491 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:54:15,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:15,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340588975] [2022-11-18 19:54:15,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340588975] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:15,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144151602] [2022-11-18 19:54:15,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:54:15,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:15,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:15,493 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:15,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-18 19:54:15,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:54:15,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:54:15,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:54:15,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:15,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-18 19:54:15,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:54:15,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144151602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:15,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:54:15,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-18 19:54:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905192989] [2022-11-18 19:54:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:15,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-18 19:54:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-18 19:54:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:54:15,739 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:15,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:15,752 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-11-18 19:54:15,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:54:15,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-18 19:54:15,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:15,754 INFO L225 Difference]: With dead ends: 104 [2022-11-18 19:54:15,754 INFO L226 Difference]: Without dead ends: 104 [2022-11-18 19:54:15,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:54:15,755 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 100 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:15,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:54:15,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-18 19:54:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-11-18 19:54:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 89 states have (on average 1.348314606741573) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:15,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2022-11-18 19:54:15,758 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 39 [2022-11-18 19:54:15,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:15,758 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2022-11-18 19:54:15,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:15,759 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2022-11-18 19:54:15,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:54:15,759 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:15,759 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:15,771 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:15,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:15,971 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:15,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:15,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1013618178, now seen corresponding path program 2 times [2022-11-18 19:54:15,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:15,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065424341] [2022-11-18 19:54:15,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:15,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:15,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-18 19:54:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:16,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065424341] [2022-11-18 19:54:16,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065424341] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:16,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761011333] [2022-11-18 19:54:16,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:54:16,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:16,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:16,143 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:16,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-18 19:54:16,340 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:54:16,340 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:54:16,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:54:16,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 19:54:16,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-18 19:54:16,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761011333] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:16,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-18 19:54:16,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2022-11-18 19:54:16,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440926643] [2022-11-18 19:54:16,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:16,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:54:16,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:16,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:54:16,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:54:16,455 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:16,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:16,480 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2022-11-18 19:54:16,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-18 19:54:16,481 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-18 19:54:16,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:16,481 INFO L225 Difference]: With dead ends: 82 [2022-11-18 19:54:16,482 INFO L226 Difference]: Without dead ends: 82 [2022-11-18 19:54:16,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:54:16,483 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 78 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:16,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 114 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:54:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-18 19:54:16,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-11-18 19:54:16,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:16,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-11-18 19:54:16,486 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 39 [2022-11-18 19:54:16,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:16,486 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-11-18 19:54:16,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-11-18 19:54:16,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-18 19:54:16,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:16,488 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:16,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:16,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:16,695 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:16,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:16,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1273435421, now seen corresponding path program 2 times [2022-11-18 19:54:16,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:16,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347962524] [2022-11-18 19:54:16,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:16,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:16,892 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:54:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:16,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347962524] [2022-11-18 19:54:16,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347962524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:16,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877147866] [2022-11-18 19:54:16,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:54:16,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:16,894 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:16,895 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:16,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-18 19:54:17,102 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:54:17,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:54:17,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:54:17,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:17,152 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 19:54:17,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-18 19:54:17,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877147866] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:17,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:17,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 10 [2022-11-18 19:54:17,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101546745] [2022-11-18 19:54:17,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:17,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-18 19:54:17,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:17,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-18 19:54:17,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-18 19:54:17,197 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:17,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:17,362 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2022-11-18 19:54:17,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:54:17,365 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-18 19:54:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:17,366 INFO L225 Difference]: With dead ends: 78 [2022-11-18 19:54:17,366 INFO L226 Difference]: Without dead ends: 78 [2022-11-18 19:54:17,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2022-11-18 19:54:17,367 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 170 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:17,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 295 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:54:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-18 19:54:17,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-11-18 19:54:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2022-11-18 19:54:17,369 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 39 [2022-11-18 19:54:17,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:17,370 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2022-11-18 19:54:17,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2022-11-18 19:54:17,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-18 19:54:17,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:17,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:17,378 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:17,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:17,572 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:17,573 INFO L85 PathProgramCache]: Analyzing trace with hash 993974679, now seen corresponding path program 1 times [2022-11-18 19:54:17,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:17,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764051932] [2022-11-18 19:54:17,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:17,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:17,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:18,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:18,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764051932] [2022-11-18 19:54:18,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764051932] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:18,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056201562] [2022-11-18 19:54:18,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:18,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:18,919 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:18,921 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:18,955 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-18 19:54:19,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:19,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 88 conjunts are in the unsatisfiable core [2022-11-18 19:54:19,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:19,216 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-18 19:54:19,317 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:54:19,318 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-18 19:54:19,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:54:19,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:54:19,500 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:19,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-18 19:54:19,806 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-18 19:54:19,813 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-18 19:54:19,980 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:19,980 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-11-18 19:54:20,116 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-18 19:54:20,309 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-18 19:54:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:20,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:20,618 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)))) is different from false [2022-11-18 19:54:20,767 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_1680 (Array Int Int))) (<= (select (select (store |c_#memory_int| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) |c_ULTIMATE.start_main_~len~0#1|)) (forall ((v_ArrVal_1680 (Array Int Int))) (<= |c_ULTIMATE.start_main_~len~0#1| (select (select (store |c_#memory_int| .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) is different from false [2022-11-18 19:54:20,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:20,956 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 32 treesize of output 33 [2022-11-18 19:54:20,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:20,967 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 58 treesize of output 61 [2022-11-18 19:54:20,979 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 23 treesize of output 21 [2022-11-18 19:54:21,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:21,016 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 32 treesize of output 33 [2022-11-18 19:54:21,020 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50 [2022-11-18 19:54:21,029 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 23 treesize of output 21 [2022-11-18 19:54:21,437 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1673 Int) (v_ArrVal_1674 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1673)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1674) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2022-11-18 19:54:21,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:21,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-18 19:54:21,455 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 39 treesize of output 27 [2022-11-18 19:54:21,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-18 19:54:21,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-18 19:54:21,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056201562] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:21,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:21,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 58 [2022-11-18 19:54:21,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813323263] [2022-11-18 19:54:21,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:21,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-11-18 19:54:21,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:21,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-11-18 19:54:21,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2716, Unknown=51, NotChecked=324, Total=3306 [2022-11-18 19:54:21,618 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:23,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:23,547 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2022-11-18 19:54:23,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-18 19:54:23,548 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-11-18 19:54:23,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:23,548 INFO L225 Difference]: With dead ends: 76 [2022-11-18 19:54:23,548 INFO L226 Difference]: Without dead ends: 76 [2022-11-18 19:54:23,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 1475 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=603, Invalid=4758, Unknown=53, NotChecked=438, Total=5852 [2022-11-18 19:54:23,550 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 306 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:23,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 874 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 777 Invalid, 0 Unknown, 332 Unchecked, 0.6s Time] [2022-11-18 19:54:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-18 19:54:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-11-18 19:54:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:23,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2022-11-18 19:54:23,553 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 42 [2022-11-18 19:54:23,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:23,553 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2022-11-18 19:54:23,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 58 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:23,554 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2022-11-18 19:54:23,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 19:54:23,554 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:23,554 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:23,563 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:23,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-18 19:54:23,761 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:23,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:23,761 INFO L85 PathProgramCache]: Analyzing trace with hash 594303695, now seen corresponding path program 1 times [2022-11-18 19:54:23,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:23,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231477217] [2022-11-18 19:54:23,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:23,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:25,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:25,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231477217] [2022-11-18 19:54:25,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231477217] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:25,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529901150] [2022-11-18 19:54:25,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:25,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:25,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:25,694 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:25,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-18 19:54:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:25,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-18 19:54:25,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:25,905 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-18 19:54:25,984 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:54:25,985 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-18 19:54:26,041 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:54:26,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:54:26,126 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:26,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-18 19:54:26,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:26,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-18 19:54:26,585 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:26,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-18 19:54:26,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-18 19:54:26,787 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:54:26,787 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:26,910 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-18 19:54:26,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:54:26,915 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) is different from false [2022-11-18 19:54:27,004 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) is different from false [2022-11-18 19:54:27,013 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1806 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) .cse0)))) is different from false [2022-11-18 19:54:27,027 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (v_ArrVal_1806 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_1805))) (.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_1806) |c_ULTIMATE.start_main_~s~0#1.base|) .cse2) .cse1)))) is different from false [2022-11-18 19:54:27,673 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_27| Int) (v_ArrVal_1806 (Array Int Int)) (v_ArrVal_1801 Int) (v_ArrVal_1803 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1801)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1803))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_27| v_ArrVal_1805)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse3))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) .cse2 v_ArrVal_1806) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse3) .cse2)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_27|))) is different from false [2022-11-18 19:54:27,688 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:27,688 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 71 [2022-11-18 19:54:27,694 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 100 treesize of output 92 [2022-11-18 19:54:27,698 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:27,701 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 24 treesize of output 16 [2022-11-18 19:54:27,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:27,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2022-11-18 19:54:27,713 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-11-18 19:54:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 9 not checked. [2022-11-18 19:54:27,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529901150] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:27,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:27,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 17, 19] total 55 [2022-11-18 19:54:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506778871] [2022-11-18 19:54:27,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:27,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-18 19:54:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:27,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-18 19:54:27,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=2367, Unknown=32, NotChecked=510, Total=3080 [2022-11-18 19:54:27,888 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 56 states, 55 states have (on average 2.4363636363636365) internal successors, (134), 56 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:29,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:29,882 INFO L93 Difference]: Finished difference Result 118 states and 121 transitions. [2022-11-18 19:54:29,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 19:54:29,883 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.4363636363636365) internal successors, (134), 56 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-18 19:54:29,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:29,884 INFO L225 Difference]: With dead ends: 118 [2022-11-18 19:54:29,884 INFO L226 Difference]: Without dead ends: 118 [2022-11-18 19:54:29,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 70 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=478, Invalid=4202, Unknown=32, NotChecked=690, Total=5402 [2022-11-18 19:54:29,887 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 626 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 999 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 521 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:29,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 934 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 999 Invalid, 0 Unknown, 521 Unchecked, 0.7s Time] [2022-11-18 19:54:29,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-18 19:54:29,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 80. [2022-11-18 19:54:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:29,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-11-18 19:54:29,889 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 48 [2022-11-18 19:54:29,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:29,890 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-11-18 19:54:29,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.4363636363636365) internal successors, (134), 56 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:29,890 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-11-18 19:54:29,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-18 19:54:29,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:29,891 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:29,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:30,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-18 19:54:30,095 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:30,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:30,096 INFO L85 PathProgramCache]: Analyzing trace with hash 594303696, now seen corresponding path program 1 times [2022-11-18 19:54:30,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:30,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219626800] [2022-11-18 19:54:30,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:30,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:33,039 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:33,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:33,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219626800] [2022-11-18 19:54:33,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219626800] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:33,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598988916] [2022-11-18 19:54:33,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:33,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:33,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:33,041 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:33,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-18 19:54:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:33,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 77 conjunts are in the unsatisfiable core [2022-11-18 19:54:33,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:33,261 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-18 19:54:33,354 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:54:33,355 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-18 19:54:33,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:54:33,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:54:33,486 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:33,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-18 19:54:33,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:33,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-18 19:54:33,990 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:33,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2022-11-18 19:54:33,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:33,997 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 41 treesize of output 41 [2022-11-18 19:54:34,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-11-18 19:54:34,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-18 19:54:34,377 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-18 19:54:34,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:34,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:34,612 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 47 treesize of output 51 [2022-11-18 19:54:34,917 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:34,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 109 [2022-11-18 19:54:34,924 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 93 treesize of output 89 [2022-11-18 19:54:34,929 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 89 treesize of output 85 [2022-11-18 19:54:35,602 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1926 Int) (v_ArrVal_1929 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1926)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1929) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2022-11-18 19:54:35,611 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:35,611 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-18 19:54:35,614 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 39 treesize of output 27 [2022-11-18 19:54:35,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-18 19:54:35,774 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2022-11-18 19:54:35,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598988916] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:35,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:35,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 17, 18] total 58 [2022-11-18 19:54:35,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003177896] [2022-11-18 19:54:35,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:35,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-18 19:54:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:35,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-18 19:54:35,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3071, Unknown=15, NotChecked=112, Total=3422 [2022-11-18 19:54:35,778 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 59 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:41,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:41,128 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2022-11-18 19:54:41,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-18 19:54:41,129 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 59 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2022-11-18 19:54:41,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:41,130 INFO L225 Difference]: With dead ends: 167 [2022-11-18 19:54:41,130 INFO L226 Difference]: Without dead ends: 167 [2022-11-18 19:54:41,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=856, Invalid=5613, Unknown=15, NotChecked=158, Total=6642 [2022-11-18 19:54:41,133 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 2246 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 1405 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2246 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 1750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 298 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:41,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2246 Valid, 1044 Invalid, 1750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1405 Invalid, 0 Unknown, 298 Unchecked, 1.2s Time] [2022-11-18 19:54:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-18 19:54:41,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 79. [2022-11-18 19:54:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 78 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:41,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 82 transitions. [2022-11-18 19:54:41,136 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 82 transitions. Word has length 48 [2022-11-18 19:54:41,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:41,137 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 82 transitions. [2022-11-18 19:54:41,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 2.3793103448275863) internal successors, (138), 59 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 82 transitions. [2022-11-18 19:54:41,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-18 19:54:41,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:41,153 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:41,158 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:41,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:41,354 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1192975024, now seen corresponding path program 1 times [2022-11-18 19:54:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:41,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619900034] [2022-11-18 19:54:41,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:41,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:54:41,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:41,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619900034] [2022-11-18 19:54:41,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619900034] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:41,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154258569] [2022-11-18 19:54:41,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:41,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:41,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:41,461 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:41,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-18 19:54:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:41,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-18 19:54:41,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:41,741 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:54:41,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:41,775 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:54:41,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154258569] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:41,775 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:41,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2022-11-18 19:54:41,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738393965] [2022-11-18 19:54:41,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:41,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 19:54:41,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:41,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 19:54:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-18 19:54:41,778 INFO L87 Difference]: Start difference. First operand 79 states and 82 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:41,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:41,824 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2022-11-18 19:54:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-18 19:54:41,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-11-18 19:54:41,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:41,825 INFO L225 Difference]: With dead ends: 79 [2022-11-18 19:54:41,825 INFO L226 Difference]: Without dead ends: 79 [2022-11-18 19:54:41,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:54:41,826 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 82 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:41,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 172 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:54:41,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-18 19:54:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2022-11-18 19:54:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 78 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:41,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2022-11-18 19:54:41,830 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 49 [2022-11-18 19:54:41,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:41,830 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2022-11-18 19:54:41,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:41,830 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2022-11-18 19:54:41,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-18 19:54:41,831 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:41,831 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:41,841 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:42,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:42,037 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:42,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:42,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1047895438, now seen corresponding path program 2 times [2022-11-18 19:54:42,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:42,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036717817] [2022-11-18 19:54:42,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:42,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-11-18 19:54:42,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:42,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036717817] [2022-11-18 19:54:42,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036717817] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:42,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70148430] [2022-11-18 19:54:42,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:54:42,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:42,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:42,151 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:42,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-18 19:54:42,404 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:54:42,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:54:42,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-18 19:54:42,408 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-18 19:54:42,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:42,576 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-18 19:54:42,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70148430] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:42,577 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:42,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 7 [2022-11-18 19:54:42,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501805693] [2022-11-18 19:54:42,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:42,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:54:42,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:42,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:54:42,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:54:42,578 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:42,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:42,660 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2022-11-18 19:54:42,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 19:54:42,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-11-18 19:54:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:42,662 INFO L225 Difference]: With dead ends: 70 [2022-11-18 19:54:42,662 INFO L226 Difference]: Without dead ends: 70 [2022-11-18 19:54:42,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-18 19:54:42,662 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 109 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:42,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 133 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-18 19:54:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-18 19:54:42,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-18 19:54:42,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 69 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:42,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2022-11-18 19:54:42,664 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 51 [2022-11-18 19:54:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:42,665 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2022-11-18 19:54:42,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2022-11-18 19:54:42,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-18 19:54:42,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:42,665 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:42,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:42,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:42,871 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:42,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:42,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1925550127, now seen corresponding path program 1 times [2022-11-18 19:54:42,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:42,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701642685] [2022-11-18 19:54:42,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:42,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:42,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:44,582 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:44,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:44,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701642685] [2022-11-18 19:54:44,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701642685] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:44,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807259910] [2022-11-18 19:54:44,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:44,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:44,583 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:44,585 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:44,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-18 19:54:44,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:44,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-18 19:54:44,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:44,861 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-18 19:54:44,977 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:54:44,977 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-18 19:54:45,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:54:45,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:54:45,164 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:45,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-18 19:54:45,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:45,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-18 19:54:45,872 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:45,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 61 [2022-11-18 19:54:45,880 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 31 treesize of output 21 [2022-11-18 19:54:45,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:45,885 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 34 treesize of output 36 [2022-11-18 19:54:46,374 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 46 treesize of output 30 [2022-11-18 19:54:46,378 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 30 treesize of output 18 [2022-11-18 19:54:46,503 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-18 19:54:46,645 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:54:46,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:47,067 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 86 treesize of output 64 [2022-11-18 19:54:47,087 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 86 treesize of output 64 [2022-11-18 19:54:47,112 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2292 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2292) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.base|)) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse1) (<= .cse1 |c_ULTIMATE.start_dll_update_at_~data#1|) (forall ((v_ArrVal_2290 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2290) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0) |c_ULTIMATE.start_dll_update_at_~head#1.offset|)))) is different from false [2022-11-18 19:54:47,141 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (+ |c_ULTIMATE.start_main_~len~0#1| 1))) (and (forall ((v_ArrVal_2290 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.offset| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2290) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (forall ((v_ArrVal_2292 (Array Int Int))) (= |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_2292) |c_ULTIMATE.start_main_~s~0#1.base|) .cse0))) (<= |c_ULTIMATE.start_dll_update_at_~data#1| .cse1) (<= .cse1 |c_ULTIMATE.start_dll_update_at_~data#1|))) is different from false [2022-11-18 19:54:47,160 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:47,161 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 50 treesize of output 43 [2022-11-18 19:54:47,166 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 17 treesize of output 13 [2022-11-18 19:54:47,815 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2287 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2022-11-18 19:54:47,824 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2285 Int) (v_ArrVal_2287 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_2285)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2287) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))))) is different from false [2022-11-18 19:54:47,842 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:47,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-18 19:54:47,845 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 39 treesize of output 27 [2022-11-18 19:54:47,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-11-18 19:54:48,015 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-11-18 19:54:48,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807259910] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:48,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:48,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 66 [2022-11-18 19:54:48,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112128027] [2022-11-18 19:54:48,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:48,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-18 19:54:48,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:48,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-18 19:54:48,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3564, Unknown=4, NotChecked=492, Total=4290 [2022-11-18 19:54:48,019 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand has 66 states, 66 states have (on average 2.196969696969697) internal successors, (145), 66 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:50,380 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2022-11-18 19:54:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-11-18 19:54:50,382 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.196969696969697) internal successors, (145), 66 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2022-11-18 19:54:50,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:50,382 INFO L225 Difference]: With dead ends: 68 [2022-11-18 19:54:50,382 INFO L226 Difference]: Without dead ends: 68 [2022-11-18 19:54:50,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 62 SyntacticMatches, 7 SemanticMatches, 87 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1954 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=625, Invalid=6527, Unknown=4, NotChecked=676, Total=7832 [2022-11-18 19:54:50,384 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 343 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 1072 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 258 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:50,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 849 Invalid, 1351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1072 Invalid, 0 Unknown, 258 Unchecked, 0.8s Time] [2022-11-18 19:54:50,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-18 19:54:50,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-18 19:54:50,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 62 states have (on average 1.096774193548387) internal successors, (68), 67 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:50,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2022-11-18 19:54:50,387 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 52 [2022-11-18 19:54:50,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:50,387 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2022-11-18 19:54:50,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.196969696969697) internal successors, (145), 66 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:50,388 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2022-11-18 19:54:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 19:54:50,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:50,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:50,400 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:50,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-18 19:54:50,589 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:50,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:50,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317609, now seen corresponding path program 1 times [2022-11-18 19:54:50,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:50,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253085028] [2022-11-18 19:54:50,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:50,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:50,735 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-11-18 19:54:50,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:50,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253085028] [2022-11-18 19:54:50,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253085028] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:50,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:50,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:54:50,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131374429] [2022-11-18 19:54:50,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:50,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:54:50,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:50,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:54:50,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:54:50,738 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:50,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:50,891 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-11-18 19:54:50,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 19:54:50,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-18 19:54:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:50,896 INFO L225 Difference]: With dead ends: 79 [2022-11-18 19:54:50,896 INFO L226 Difference]: Without dead ends: 79 [2022-11-18 19:54:50,896 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:54:50,897 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 141 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:50,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 75 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:54:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-18 19:54:50,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2022-11-18 19:54:50,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 64 states have (on average 1.109375) internal successors, (71), 68 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:50,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-11-18 19:54:50,900 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 56 [2022-11-18 19:54:50,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:50,900 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-11-18 19:54:50,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 7 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:50,901 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-11-18 19:54:50,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-18 19:54:50,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:50,901 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:50,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-18 19:54:50,902 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:50,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:50,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1981317608, now seen corresponding path program 1 times [2022-11-18 19:54:50,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:50,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438460750] [2022-11-18 19:54:50,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:50,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 19:54:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:51,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438460750] [2022-11-18 19:54:51,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438460750] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:51,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:51,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:54:51,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225022159] [2022-11-18 19:54:51,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:51,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:54:51,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:51,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:54:51,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:54:51,165 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:51,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:51,362 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2022-11-18 19:54:51,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:54:51,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2022-11-18 19:54:51,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:51,363 INFO L225 Difference]: With dead ends: 77 [2022-11-18 19:54:51,364 INFO L226 Difference]: Without dead ends: 77 [2022-11-18 19:54:51,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:54:51,365 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 181 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:51,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 50 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:54:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-18 19:54:51,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-11-18 19:54:51,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0909090909090908) internal successors, (72), 70 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:51,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-11-18 19:54:51,368 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 56 [2022-11-18 19:54:51,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:51,369 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-11-18 19:54:51,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-11-18 19:54:51,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-18 19:54:51,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:51,370 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:51,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-18 19:54:51,370 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:51,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1291305133, now seen corresponding path program 1 times [2022-11-18 19:54:51,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:51,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983277943] [2022-11-18 19:54:51,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:51,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:51,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:51,502 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 19:54:51,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:51,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983277943] [2022-11-18 19:54:51,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983277943] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:51,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:51,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 19:54:51,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024402104] [2022-11-18 19:54:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:51,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:54:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:51,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:54:51,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:54:51,505 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:51,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:51,623 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2022-11-18 19:54:51,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:54:51,623 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-11-18 19:54:51,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:51,624 INFO L225 Difference]: With dead ends: 74 [2022-11-18 19:54:51,624 INFO L226 Difference]: Without dead ends: 74 [2022-11-18 19:54:51,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:54:51,625 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 168 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:51,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 76 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:54:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-18 19:54:51,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2022-11-18 19:54:51,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0757575757575757) internal successors, (71), 70 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2022-11-18 19:54:51,627 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 57 [2022-11-18 19:54:51,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:51,628 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2022-11-18 19:54:51,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:51,628 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2022-11-18 19:54:51,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-18 19:54:51,628 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:51,628 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:51,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-18 19:54:51,629 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:51,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:51,629 INFO L85 PathProgramCache]: Analyzing trace with hash 302765524, now seen corresponding path program 1 times [2022-11-18 19:54:51,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:51,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040389592] [2022-11-18 19:54:51,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:51,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:51,782 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-18 19:54:51,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:51,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040389592] [2022-11-18 19:54:51,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040389592] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 19:54:51,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 19:54:51,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 19:54:51,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202240229] [2022-11-18 19:54:51,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 19:54:51,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 19:54:51,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:51,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 19:54:51,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 19:54:51,784 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:51,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:51,922 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2022-11-18 19:54:51,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 19:54:51,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2022-11-18 19:54:51,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:51,923 INFO L225 Difference]: With dead ends: 72 [2022-11-18 19:54:51,923 INFO L226 Difference]: Without dead ends: 72 [2022-11-18 19:54:51,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-18 19:54:51,924 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 155 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:51,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 63 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-18 19:54:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-18 19:54:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-18 19:54:51,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 71 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:51,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2022-11-18 19:54:51,926 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 59 [2022-11-18 19:54:51,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:51,927 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2022-11-18 19:54:51,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2022-11-18 19:54:51,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-18 19:54:51,927 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:51,927 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:51,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-18 19:54:51,928 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:51,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:51,928 INFO L85 PathProgramCache]: Analyzing trace with hash 256575356, now seen corresponding path program 1 times [2022-11-18 19:54:51,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:51,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714278524] [2022-11-18 19:54:51,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:51,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:53,272 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-18 19:54:53,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:54:53,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714278524] [2022-11-18 19:54:53,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714278524] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:54:53,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838951995] [2022-11-18 19:54:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:53,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:54:53,273 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:54:53,275 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:54:53,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-18 19:54:53,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:54:53,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 81 conjunts are in the unsatisfiable core [2022-11-18 19:54:53,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:54:53,573 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-18 19:54:53,619 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:54:53,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 19:54:53,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:54:53,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:54:53,741 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:53,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2022-11-18 19:54:53,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:54:53,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-18 19:54:54,080 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:54,081 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 21 treesize of output 24 [2022-11-18 19:54:54,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:54,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-18 19:54:54,528 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:54:54,528 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-18 19:54:54,535 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 19:54:54,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:54:54,758 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:54,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-11-18 19:54:55,147 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_2653 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse0 4) (select .cse0 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))))) (forall ((v_ArrVal_2653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))))) is different from false [2022-11-18 19:54:55,166 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2653 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse0 .cse1) (select .cse0 4)))) (forall ((v_ArrVal_2653 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2653) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|)))))) is different from false [2022-11-18 19:54:55,190 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|))) (and (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2652)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse0 4) (select .cse0 .cse1)))) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_update_at_~head#1.offset| v_ArrVal_2652)))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~s~0#1.base|) .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))))) is different from false [2022-11-18 19:54:55,224 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_ULTIMATE.start_main_~s~0#1.base|))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse4) (select .cse4 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_main_~s~0#1.base|))) (= (select .cse3 4) (select .cse3 .cse1)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-18 19:54:55,257 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_ULTIMATE.start_dll_create_#res#1.base|))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse4) (select .cse4 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_#res#1.base|))) (= (select .cse3 4) (select .cse3 .cse1)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-18 19:54:55,292 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= (select (select (let ((.cse0 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse0) (select .cse0 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (let ((.cse3 (select (let ((.cse4 (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse4) (select .cse4 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select .cse3 4) (select .cse3 .cse1)))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-18 19:54:55,342 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (let ((.cse0 (select (let ((.cse2 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) (select .cse2 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select .cse0 .cse1) (select .cse0 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse4 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (select .cse4 .cse1) v_ArrVal_2653)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))))) is different from false [2022-11-18 19:54:55,371 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse3 (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (select .cse3 .cse1) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select .cse0 .cse1) (select .cse0 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (select .cse5 .cse1) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))))))) is different from false [2022-11-18 19:54:55,422 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (v_ArrVal_2648 Int)) (or (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2648)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 .cse2) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)))) (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|))) (forall ((v_ArrVal_2650 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_39| Int) (v_ArrVal_2648 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_39|) (forall ((v_ArrVal_2652 Int) (v_ArrVal_2653 (Array Int Int))) (let ((.cse5 (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2648)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2650))) (let ((.cse7 (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_39| v_ArrVal_2652))) (store (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse7) (select .cse7 .cse2) v_ArrVal_2653))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select .cse5 4) (select .cse5 .cse2)))))))) is different from false [2022-11-18 19:54:55,446 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:55,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 58 [2022-11-18 19:54:55,453 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 105 treesize of output 97 [2022-11-18 19:54:55,459 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:55,469 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:55,469 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 93 treesize of output 92 [2022-11-18 19:54:55,476 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 83 treesize of output 79 [2022-11-18 19:54:55,480 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:54:55,492 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:54:55,492 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 93 treesize of output 87 [2022-11-18 19:54:55,575 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 19:54:55,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 161 treesize of output 1 [2022-11-18 19:54:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2022-11-18 19:54:55,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838951995] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:54:55,681 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:54:55,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 25] total 55 [2022-11-18 19:54:55,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677883339] [2022-11-18 19:54:55,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:54:55,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-18 19:54:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:54:55,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-18 19:54:55,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1980, Unknown=39, NotChecked=882, Total=3080 [2022-11-18 19:54:55,684 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand has 56 states, 55 states have (on average 2.7636363636363637) internal successors, (152), 56 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:58,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:54:58,152 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2022-11-18 19:54:58,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 19:54:58,153 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.7636363636363637) internal successors, (152), 56 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-18 19:54:58,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:54:58,153 INFO L225 Difference]: With dead ends: 79 [2022-11-18 19:54:58,154 INFO L226 Difference]: Without dead ends: 79 [2022-11-18 19:54:58,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=533, Invalid=3754, Unknown=39, NotChecked=1224, Total=5550 [2022-11-18 19:54:58,156 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 498 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 620 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-18 19:54:58,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 581 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 882 Invalid, 0 Unknown, 620 Unchecked, 0.7s Time] [2022-11-18 19:54:58,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-18 19:54:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-11-18 19:54:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.1) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-11-18 19:54:58,159 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 62 [2022-11-18 19:54:58,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:54:58,159 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-11-18 19:54:58,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.7636363636363637) internal successors, (152), 56 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:54:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-11-18 19:54:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-18 19:54:58,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:54:58,161 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:54:58,172 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-18 19:54:58,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-18 19:54:58,367 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:54:58,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:54:58,368 INFO L85 PathProgramCache]: Analyzing trace with hash 256575357, now seen corresponding path program 1 times [2022-11-18 19:54:58,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:54:58,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792641548] [2022-11-18 19:54:58,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:54:58,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:54:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-18 19:55:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792641548] [2022-11-18 19:55:00,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792641548] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:00,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857301279] [2022-11-18 19:55:00,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:00,594 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:00,596 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-18 19:55:00,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:00,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 96 conjunts are in the unsatisfiable core [2022-11-18 19:55:00,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:00,858 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-18 19:55:00,946 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:55:00,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-18 19:55:00,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:55:00,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:55:01,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:55:01,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:55:01,108 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:55:01,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-11-18 19:55:01,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-18 19:55:01,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:01,261 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 19 treesize of output 18 [2022-11-18 19:55:01,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:01,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-18 19:55:01,544 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:55:01,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2022-11-18 19:55:01,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:01,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 19:55:02,045 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:02,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 15 [2022-11-18 19:55:02,052 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:02,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-18 19:55:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-18 19:55:02,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:03,126 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (and (forall ((v_ArrVal_2790 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (<= 0 (+ (select .cse0 4) 4)) (< (select .cse0 .cse1) 0)))) (forall ((v_ArrVal_2790 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (< (select .cse2 .cse1) 0) (forall ((v_ArrVal_2789 (Array Int Int))) (<= (+ 8 (select .cse2 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base| v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4))))))))) is different from false [2022-11-18 19:55:03,374 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_~head#1.base|) (+ |c_ULTIMATE.start_dll_update_at_~head#1.offset| 4)))) (and (forall ((v_ArrVal_2790 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (forall ((v_ArrVal_2789 (Array Int Int))) (<= (+ 8 (select .cse0 4)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (< (select .cse0 .cse2) 0)))) (forall ((v_ArrVal_2790 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (<= 0 (+ 4 (select .cse3 4))) (< (select .cse3 .cse2) 0)))))) is different from false [2022-11-18 19:55:03,413 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2790 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (< (select .cse0 .cse1) 0) (<= 0 (+ (select .cse0 4) 4))))) (forall ((v_ArrVal_2790 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (forall ((v_ArrVal_2789 (Array Int Int))) (<= (+ (select .cse3 4) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (< (select .cse3 .cse1) 0))))))) is different from false [2022-11-18 19:55:03,814 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse1) v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (<= 0 (+ (select .cse0 4) 4)) (< (select .cse0 .cse1) 0)))) (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_main_~s~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse5 (store .cse3 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse6 (select .cse5 .cse1))) (let ((.cse4 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse2 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse6 v_ArrVal_2790) |c_ULTIMATE.start_main_~s~0#1.base|))) (or (forall ((v_ArrVal_2789 (Array Int Int))) (<= (+ (select .cse4 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| .cse5) .cse6 v_ArrVal_2789) |c_ULTIMATE.start_main_~s~0#1.base|) 4)))) (< (select .cse4 .cse1) 0)))))))))) is different from false [2022-11-18 19:55:03,877 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse2 (select .cse1 .cse3))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse2 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|))) (or (forall ((v_ArrVal_2789 (Array Int Int))) (<= (+ (select .cse0 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse1) .cse2 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_#res#1.base|) 4)))) (< (select .cse0 .cse3) 0)))))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse3) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_#res#1.base|))) (or (<= 0 (+ (select .cse6 4) 4)) (< (select .cse6 .cse3) 0)))) (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))))) is different from false [2022-11-18 19:55:03,924 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse1 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse2 (select .cse1 .cse3))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse2 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (forall ((v_ArrVal_2789 (Array Int Int))) (<= (+ 8 (select .cse0 4)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse1) .cse2 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)))) (< (select .cse0 .cse3) 0)))))) (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse3) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (<= 0 (+ (select .cse6 4) 4)) (< (select .cse6 .cse3) 0)))))))) is different from false [2022-11-18 19:55:04,007 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse2 (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786))) (let ((.cse3 (select .cse2 .cse1))) (let ((.cse0 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) .cse3 v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse0 .cse1) 0) (forall ((v_ArrVal_2789 (Array Int Int))) (<= (+ (select .cse0 4) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2) .cse3 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))))))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (forall ((v_ArrVal_2786 Int) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788)) (select (store .cse5 |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse1) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse6 .cse1) 0) (<= 0 (+ (select .cse6 4) 4))))))))) is different from false [2022-11-18 19:55:04,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:04,060 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 205 treesize of output 209 [2022-11-18 19:55:04,238 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_3 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_3) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_7))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_4) .cse1) v_prenex_8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse0 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (< (select .cse0 .cse1) 0)))))) (forall ((v_prenex_3 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_3) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse4 (store (select .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_4))) (let ((.cse5 (select .cse4 .cse1))) (or (forall ((v_ArrVal_2789 (Array Int Int))) (= (select (select (store (store .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse5 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (store .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_7))) .cse5 v_prenex_8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 0)))))))) (forall ((|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse7 (select (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse1) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select .cse7 4) 4)) (< (select .cse7 .cse1) 0)))))) is different from false [2022-11-18 19:55:04,388 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_2780 Int) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_42| Int) (v_ArrVal_2786 Int) (v_ArrVal_2783 (Array Int Int)) (v_ArrVal_2782 (Array Int Int)) (v_ArrVal_2788 Int) (v_ArrVal_2778 Int) (v_ArrVal_2790 (Array Int Int))) (let ((.cse0 (select (store (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2780)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2783))) (store .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2788))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_2778)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_2782) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_42| v_ArrVal_2786) .cse1) v_ArrVal_2790) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_42|) (<= 0 (+ (select .cse0 4) 4)) (< (select .cse0 .cse1) 0)))) (forall ((v_ArrVal_2780 Int) (v_prenex_3 Int) (v_ArrVal_2778 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_3) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse6 (select (store (let ((.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2780)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (store .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_7))) (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_2778)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_4) .cse1) v_prenex_8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (or (< (select .cse6 4) (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (< (select .cse6 .cse1) 0)))))) (forall ((v_ArrVal_2780 Int) (v_prenex_3 Int) (v_ArrVal_2778 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| v_prenex_3) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 Int) (v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse5 .cse4 v_ArrVal_2778)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse9 (store (select .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_4))) (let ((.cse10 (select .cse9 .cse1))) (or (forall ((v_ArrVal_2789 (Array Int Int))) (= (select (select (store (store .cse8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse9) .cse10 v_ArrVal_2789) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< (select (select (store (let ((.cse11 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_2780)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) v_prenex_3 v_prenex_7))) .cse10 v_prenex_8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 0)))))))))) is different from false [2022-11-18 19:55:04,444 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:04,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 127 [2022-11-18 19:55:04,459 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:04,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 97 [2022-11-18 19:55:04,466 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 165 treesize of output 159 [2022-11-18 19:55:04,475 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 405 treesize of output 395 [2022-11-18 19:55:04,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,487 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 179 treesize of output 143 [2022-11-18 19:55:04,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,503 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 169 treesize of output 137 [2022-11-18 19:55:04,511 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,524 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-18 19:55:04,524 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 301 treesize of output 288 [2022-11-18 19:55:04,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,543 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 299 treesize of output 287 [2022-11-18 19:55:04,551 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,552 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 287 treesize of output 263 [2022-11-18 19:55:04,713 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:04,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 127 [2022-11-18 19:55:04,729 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:04,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 97 [2022-11-18 19:55:04,738 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 165 treesize of output 159 [2022-11-18 19:55:04,747 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 405 treesize of output 395 [2022-11-18 19:55:04,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,761 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 169 treesize of output 137 [2022-11-18 19:55:04,769 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,774 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 179 treesize of output 143 [2022-11-18 19:55:04,785 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,797 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:55:04,798 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 301 treesize of output 289 [2022-11-18 19:55:04,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:04,825 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:55:04,826 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 279 treesize of output 271 [2022-11-18 19:55:04,846 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:55:04,846 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 267 treesize of output 247 [2022-11-18 19:55:05,020 INFO L321 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-18 19:55:05,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 1 [2022-11-18 19:55:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 13 not checked. [2022-11-18 19:55:05,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857301279] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:05,245 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:05,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 25] total 61 [2022-11-18 19:55:05,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103427752] [2022-11-18 19:55:05,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:05,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-11-18 19:55:05,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:05,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-11-18 19:55:05,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2473, Unknown=42, NotChecked=990, Total=3782 [2022-11-18 19:55:05,248 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 62 states, 61 states have (on average 2.6885245901639343) internal successors, (164), 62 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:14,991 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2022-11-18 19:55:14,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-18 19:55:14,992 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.6885245901639343) internal successors, (164), 62 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-11-18 19:55:14,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:14,993 INFO L225 Difference]: With dead ends: 83 [2022-11-18 19:55:14,993 INFO L226 Difference]: Without dead ends: 83 [2022-11-18 19:55:14,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 88 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 935 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=775, Invalid=4475, Unknown=42, NotChecked=1350, Total=6642 [2022-11-18 19:55:14,995 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 779 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 782 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:14,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 656 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 852 Invalid, 0 Unknown, 782 Unchecked, 0.8s Time] [2022-11-18 19:55:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-18 19:55:14,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 77. [2022-11-18 19:55:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 76 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2022-11-18 19:55:14,998 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 62 [2022-11-18 19:55:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:14,998 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2022-11-18 19:55:14,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.6885245901639343) internal successors, (164), 62 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:14,999 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-11-18 19:55:14,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-18 19:55:14,999 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:14,999 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:15,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:15,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:15,208 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:55:15,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:15,208 INFO L85 PathProgramCache]: Analyzing trace with hash -636099954, now seen corresponding path program 1 times [2022-11-18 19:55:15,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:15,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494600021] [2022-11-18 19:55:15,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:15,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:16,666 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:55:16,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:16,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494600021] [2022-11-18 19:55:16,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494600021] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:16,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390026982] [2022-11-18 19:55:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:16,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:16,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:16,669 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:16,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-11-18 19:55:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:17,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 79 conjunts are in the unsatisfiable core [2022-11-18 19:55:17,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:17,058 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-18 19:55:17,214 INFO L321 Elim1Store]: treesize reduction 26, result has 27.8 percent of original size [2022-11-18 19:55:17,214 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 3 case distinctions, treesize of input 22 treesize of output 29 [2022-11-18 19:55:17,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:55:17,411 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-18 19:55:17,459 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:55:17,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-18 19:55:17,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:17,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-11-18 19:55:17,973 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-11-18 19:55:17,973 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 29 treesize of output 32 [2022-11-18 19:55:18,478 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-11-18 19:55:18,479 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 3 case distinctions, treesize of input 20 treesize of output 22 [2022-11-18 19:55:18,608 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:18,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2022-11-18 19:55:18,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:55:18,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:22,759 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:22,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 213 treesize of output 113 [2022-11-18 19:55:22,783 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:22,784 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 719 treesize of output 693 [2022-11-18 19:55:22,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:22,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:22,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 981 treesize of output 937 [2022-11-18 19:55:23,730 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:23,742 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:23,743 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 302 treesize of output 288 [2022-11-18 19:55:24,862 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 9 proven. 16 refuted. 2 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-18 19:55:24,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390026982] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:24,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:24,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 56 [2022-11-18 19:55:24,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630794470] [2022-11-18 19:55:24,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:24,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-11-18 19:55:24,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:24,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-11-18 19:55:24,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2790, Unknown=21, NotChecked=0, Total=3080 [2022-11-18 19:55:24,865 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:27,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:27,682 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2022-11-18 19:55:27,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-18 19:55:27,683 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2022-11-18 19:55:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:27,684 INFO L225 Difference]: With dead ends: 80 [2022-11-18 19:55:27,684 INFO L226 Difference]: Without dead ends: 80 [2022-11-18 19:55:27,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 100 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=730, Invalid=5255, Unknown=21, NotChecked=0, Total=6006 [2022-11-18 19:55:27,685 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 293 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 255 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:27,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 703 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 623 Invalid, 0 Unknown, 255 Unchecked, 0.5s Time] [2022-11-18 19:55:27,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-18 19:55:27,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-11-18 19:55:27,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 72 states have (on average 1.0694444444444444) internal successors, (77), 76 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2022-11-18 19:55:27,688 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 63 [2022-11-18 19:55:27,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:27,689 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2022-11-18 19:55:27,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 3.0535714285714284) internal successors, (171), 56 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:27,689 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2022-11-18 19:55:27,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-18 19:55:27,690 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:27,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:27,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-11-18 19:55:27,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-18 19:55:27,895 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:55:27,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:27,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1405249969, now seen corresponding path program 1 times [2022-11-18 19:55:27,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:27,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863316120] [2022-11-18 19:55:27,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:27,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:29,356 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:55:29,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863316120] [2022-11-18 19:55:29,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863316120] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:29,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894897322] [2022-11-18 19:55:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:29,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:29,358 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:29,358 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:29,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-11-18 19:55:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:29,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 64 conjunts are in the unsatisfiable core [2022-11-18 19:55:29,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:29,660 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-18 19:55:29,741 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:55:29,741 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-18 19:55:29,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-18 19:55:29,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:55:29,893 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:55:29,893 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 34 treesize of output 35 [2022-11-18 19:55:30,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:30,057 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 29 treesize of output 24 [2022-11-18 19:55:30,345 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-18 19:55:30,346 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-18 19:55:30,610 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:30,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-18 19:55:30,747 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-18 19:55:30,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:31,148 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_update_at_#t~mem10#1.base| v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-18 19:55:31,266 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|) (+ |c_ULTIMATE.start_main_~s~0#1.offset| 4)) v_ArrVal_3048) |c_ULTIMATE.start_main_~s~0#1.base|) 4) |c_#StackHeapBarrier|)) is different from false [2022-11-18 19:55:31,622 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_#res#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_#res#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_#res#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-18 19:55:31,814 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-18 19:55:32,008 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3044 (Array Int Int)) (v_ArrVal_3048 (Array Int Int)) (|v_ULTIMATE.start_dll_update_at_~head#1.offset_49| Int) (v_ArrVal_3046 Int) (v_ArrVal_3042 Int)) (or (< |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_update_at_~head#1.offset_49|) (< (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_3042)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3044))) (let ((.cse1 (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |v_ULTIMATE.start_dll_update_at_~head#1.offset_49| v_ArrVal_3046))) (store (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (select .cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) v_ArrVal_3048))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_#StackHeapBarrier|))) is different from false [2022-11-18 19:55:32,022 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:32,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 57 [2022-11-18 19:55:32,042 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 100 treesize of output 92 [2022-11-18 19:55:32,045 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:32,057 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:32,057 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 55 treesize of output 49 [2022-11-18 19:55:32,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 19:55:32,075 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:32,075 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 45 treesize of output 44 [2022-11-18 19:55:32,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2022-11-18 19:55:32,421 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 6 not checked. [2022-11-18 19:55:32,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [894897322] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-18 19:55:32,421 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-18 19:55:32,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 21] total 46 [2022-11-18 19:55:32,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258138242] [2022-11-18 19:55:32,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-18 19:55:32,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-11-18 19:55:32,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 19:55:32,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-11-18 19:55:32,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1508, Unknown=87, NotChecked=420, Total=2162 [2022-11-18 19:55:32,424 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:35,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-18 19:55:35,211 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-11-18 19:55:35,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-18 19:55:35,212 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-11-18 19:55:35,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-18 19:55:35,213 INFO L225 Difference]: With dead ends: 78 [2022-11-18 19:55:35,213 INFO L226 Difference]: Without dead ends: 78 [2022-11-18 19:55:35,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 103 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=458, Invalid=3133, Unknown=89, NotChecked=610, Total=4290 [2022-11-18 19:55:35,214 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 423 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-18 19:55:35,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 551 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 547 Invalid, 0 Unknown, 554 Unchecked, 0.5s Time] [2022-11-18 19:55:35,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-18 19:55:35,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-18 19:55:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 77 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-11-18 19:55:35,217 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 65 [2022-11-18 19:55:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-18 19:55:35,218 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-11-18 19:55:35,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 3.130434782608696) internal successors, (144), 47 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 19:55:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-11-18 19:55:35,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-18 19:55:35,219 INFO L187 NwaCegarLoop]: Found error trace [2022-11-18 19:55:35,219 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 19:55:35,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-11-18 19:55:35,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-18 19:55:35,426 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-11-18 19:55:35,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 19:55:35,427 INFO L85 PathProgramCache]: Analyzing trace with hash -755420895, now seen corresponding path program 2 times [2022-11-18 19:55:35,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 19:55:35,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361340570] [2022-11-18 19:55:35,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 19:55:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 19:55:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 19:55:38,535 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-18 19:55:38,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 19:55:38,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361340570] [2022-11-18 19:55:38,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361340570] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-18 19:55:38,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904953248] [2022-11-18 19:55:38,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-18 19:55:38,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-18 19:55:38,536 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 19:55:38,540 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-18 19:55:38,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_da64d683-5a97-4905-aead-d5cbb8ffbad4/bin/uautomizer-TMbwUNV5ro/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-11-18 19:55:38,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-18 19:55:38,832 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-18 19:55:38,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 159 conjunts are in the unsatisfiable core [2022-11-18 19:55:38,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-18 19:55:38,926 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-18 19:55:39,035 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-18 19:55:39,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:39,123 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-18 19:55:39,135 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-18 19:55:39,142 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-18 19:55:39,236 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:55:39,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:39,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-18 19:55:39,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-18 19:55:39,392 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-18 19:55:39,393 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-18 19:55:39,523 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-18 19:55:39,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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-18 19:55:39,544 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-18 19:55:39,560 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-18 19:55:39,572 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-18 19:55:39,581 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-18 19:55:39,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-18 19:55:39,702 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-18 19:55:39,710 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-18 19:55:39,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:39,829 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-18 19:55:39,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 74 [2022-11-18 19:55:39,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:39,838 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 33 treesize of output 28 [2022-11-18 19:55:39,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:55:39,847 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 33 treesize of output 28 [2022-11-18 19:55:40,401 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-18 19:55:40,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 50 [2022-11-18 19:55:40,409 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-18 19:55:40,416 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-18 19:55:41,566 INFO L321 Elim1Store]: treesize reduction 92, result has 51.3 percent of original size [2022-11-18 19:55:41,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 142 treesize of output 180 [2022-11-18 19:55:41,664 INFO L321 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2022-11-18 19:55:41,664 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 86 [2022-11-18 19:55:41,754 INFO L321 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2022-11-18 19:55:41,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 78 [2022-11-18 19:55:49,472 INFO L321 Elim1Store]: treesize reduction 100, result has 57.4 percent of original size [2022-11-18 19:55:49,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 276 treesize of output 352 [2022-11-18 19:55:55,210 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-18 19:55:55,548 INFO L321 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-11-18 19:55:55,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 98 [2022-11-18 19:55:55,612 INFO L321 Elim1Store]: treesize reduction 28, result has 54.1 percent of original size [2022-11-18 19:55:55,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 79 [2022-11-18 19:55:55,640 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:55:55,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 67 [2022-11-18 19:55:56,346 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 19:55:56,347 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-18 19:55:56,537 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 10 treesize of output 8 [2022-11-18 19:56:45,994 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse2 (select .cse8 4))) (and (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3210 Int) (v_subst_1 Int)) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse8 0 v_ArrVal_3203)))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_subst_1 v_ArrVal_3210))) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_main_~s~0#1.base|) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3204))) (store .cse6 .cse2 (store (select .cse6 .cse2) v_subst_1 v_ArrVal_3209))))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (< (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3201))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_subst_1 v_ArrVal_3206))) .cse0) .cse3) .cse4) (not (= .cse3 0)) (= (select (select .cse5 .cse0) 4) 0)))))))) (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3210 Int) (v_subst_2 Int)) (let ((.cse10 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~s~0#1.base| (store .cse8 0 v_ArrVal_3203)))) (store .cse14 .cse2 (store (select .cse14 .cse2) v_subst_2 v_ArrVal_3210))))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (= .cse9 |c_ULTIMATE.start_main_~s~0#1.base|) (= (select (select .cse10 .cse9) 4) 0) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse11 (select (select (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3204))) (store .cse13 .cse2 (store (select .cse13 .cse2) v_subst_2 v_ArrVal_3209))) |c_ULTIMATE.start_main_~s~0#1.base|) 4))) (or (not (= 0 .cse11)) (< (select (select (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_3201))) (store .cse12 .cse2 (store (select .cse12 .cse2) v_subst_2 v_ArrVal_3206))) .cse9) .cse11) .cse4))))))))))) is different from false [2022-11-18 19:56:46,086 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse1 (select .cse8 4))) (and (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3210 Int) (v_subst_2 Int)) (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse8 0 v_ArrVal_3203)))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_subst_2 v_ArrVal_3210))))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (or (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse3 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_3204))) (store .cse5 .cse1 (store (select .cse5 .cse1) v_subst_2 v_ArrVal_3209))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (or (< (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_3201))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_subst_2 v_ArrVal_3206))) .cse2) .cse3) .cse4) (not (= .cse3 0))))) (= (select (select .cse6 .cse2) 4) 0) (= .cse2 |c_ULTIMATE.start_dll_create_#res#1.base|))))) (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3210 Int) (v_subst_1 Int)) (let ((.cse9 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_#res#1.base| (store .cse8 0 v_ArrVal_3203)))) (store .cse14 .cse1 (store (select .cse14 .cse1) v_subst_1 v_ArrVal_3210))) |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (or (= .cse9 |c_ULTIMATE.start_dll_create_#res#1.base|) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_3204))) (store .cse13 .cse1 (store (select .cse13 .cse1) v_subst_1 v_ArrVal_3209))))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_dll_create_#res#1.base|) 4))) (or (< (select (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_#res#1.base| v_ArrVal_3201))) (store .cse10 .cse1 (store (select .cse10 .cse1) v_subst_1 v_ArrVal_3206))) .cse9) .cse11) .cse4) (= (select (select .cse12 .cse9) 4) 0) (not (= .cse11 0)))))))))))) is different from false [2022-11-18 19:56:46,152 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse2 (select .cse8 4))) (and (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3210 Int) (v_subst_2 Int)) (let ((.cse6 (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse8 0 v_ArrVal_3203)))) (store .cse7 .cse2 (store (select .cse7 .cse2) v_subst_2 v_ArrVal_3210))))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (or (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse0 (select (select (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3204))) (store .cse5 .cse2 (store (select .cse5 .cse2) v_subst_2 v_ArrVal_3209))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (or (not (= .cse0 0)) (< (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3201))) (store .cse1 .cse2 (store (select .cse1 .cse2) v_subst_2 v_ArrVal_3206))) .cse3) .cse0) .cse4)))) (= (select (select .cse6 .cse3) 4) 0) (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3210 Int) (v_subst_1 Int)) (let ((.cse9 (select (select (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse8 0 v_ArrVal_3203)))) (store .cse14 .cse2 (store (select .cse14 .cse2) v_subst_1 v_ArrVal_3210))) |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse12 (let ((.cse13 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3204))) (store .cse13 .cse2 (store (select .cse13 .cse2) v_subst_1 v_ArrVal_3209))))) (let ((.cse11 (select (select .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (or (< (select (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_3201))) (store .cse10 .cse2 (store (select .cse10 .cse2) v_subst_1 v_ArrVal_3206))) .cse9) .cse11) .cse4) (= (select (select .cse12 .cse9) 4) 0) (not (= 0 .cse11)))))))))))) is different from false [2022-11-18 19:56:46,301 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse5 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse4 (select .cse8 4))) (and (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3210 Int) (v_subst_1 Int)) (let ((.cse0 (select (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse8 0 v_ArrVal_3203)))) (store .cse7 .cse4 (store (select .cse7 .cse4) v_subst_1 v_ArrVal_3210))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse2 (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse6 .cse4 (store (select .cse6 .cse4) v_subst_1 v_ArrVal_3209))))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= .cse1 0)) (= (select (select .cse2 .cse0) 4) 0) (< (select (select (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse3 .cse4 (store (select .cse3 .cse4) v_subst_1 v_ArrVal_3206))) .cse0) .cse1) .cse5)))))))) (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3210 Int) (v_subst_2 Int)) (let ((.cse13 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse8 0 v_ArrVal_3203)))) (store .cse14 .cse4 (store (select .cse14 .cse4) v_subst_2 v_ArrVal_3210))))) (let ((.cse9 (select (select .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse11 (select (select (let ((.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse12 .cse4 (store (select .cse12 .cse4) v_subst_2 v_ArrVal_3209))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (< (select (select (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse10 .cse4 (store (select .cse10 .cse4) v_subst_2 v_ArrVal_3206))) .cse9) .cse11) .cse5) (not (= .cse11 0))))) (= (select (select .cse13 .cse9) 4) 0)))))))) is different from false [2022-11-18 19:56:46,413 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse7 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse9 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse13 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3199 Int) (v_ArrVal_3210 Int) (v_ArrVal_3197 Int) (v_subst_2 Int) (v_ArrVal_3198 Int)) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse13 .cse6 v_ArrVal_3199)))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse12 4))) (let ((.cse1 (let ((.cse10 (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse12 0 v_ArrVal_3203)))) (store .cse10 .cse4 (store (select .cse10 .cse4) v_subst_2 v_ArrVal_3210))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select .cse1 .cse0) 4) 0) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse2 (select (select (let ((.cse8 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse6 v_ArrVal_3197)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse8 .cse4 (store (select .cse8 .cse4) v_subst_2 v_ArrVal_3209))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= .cse2 0)) (< (select (select (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_3198)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse3 .cse4 (store (select .cse3 .cse4) v_subst_2 v_ArrVal_3206))) .cse0) .cse2) .cse7))))))))))) (forall ((v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3199 Int) (v_ArrVal_3210 Int) (v_ArrVal_3197 Int) (v_ArrVal_3198 Int) (v_subst_1 Int)) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse13 .cse6 v_ArrVal_3199)))) (let ((.cse22 (select .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse16 (select .cse22 4))) (let ((.cse14 (select (select (let ((.cse20 (store .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse22 0 v_ArrVal_3203)))) (store .cse20 .cse16 (store (select .cse20 .cse16) v_subst_1 v_ArrVal_3210))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse14) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse18 (let ((.cse19 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse9 .cse6 v_ArrVal_3197)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse19 .cse16 (store (select .cse19 .cse16) v_subst_1 v_ArrVal_3209))))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (< (select (select (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store .cse5 .cse6 v_ArrVal_3198)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse15 .cse16 (store (select .cse15 .cse16) v_subst_1 v_ArrVal_3206))) .cse14) .cse17) .cse7) (not (= .cse17 0)) (= (select (select .cse18 .cse14) 4) 0))))))))))))) is different from false [2022-11-18 19:56:46,715 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse14 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse15 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_3194 Int) (v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3199 Int) (v_ArrVal_3210 Int) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3197 Int) (v_ArrVal_3198 Int) (v_subst_1 Int) (v_ArrVal_3193 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse14 .cse15 v_ArrVal_3194)))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3199))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse12 4))) (let ((.cse2 (select (select (let ((.cse10 (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse12 0 v_ArrVal_3203)))) (store .cse10 .cse4 (store (select .cse10 .cse4) v_subst_1 v_ArrVal_3210))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse1 (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3191))) (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3197))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse8 .cse4 (store (select .cse8 .cse4) v_subst_1 v_ArrVal_3209))))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= .cse0 0)) (= (select (select .cse1 .cse2) 4) 0) (< (select (select (let ((.cse3 (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3193))) (store .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3198))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse3 .cse4 (store (select .cse3 .cse4) v_subst_1 v_ArrVal_3206))) .cse2) .cse0) .cse7))))) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))) (forall ((v_ArrVal_3194 Int) (v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3199 Int) (v_ArrVal_3210 Int) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3197 Int) (v_subst_2 Int) (v_ArrVal_3198 Int) (v_ArrVal_3193 (Array Int Int))) (let ((.cse25 (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse14 .cse15 v_ArrVal_3194)))) (store .cse27 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3199))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse19 (select .cse26 4))) (let ((.cse17 (let ((.cse24 (store .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse26 0 v_ArrVal_3203)))) (store .cse24 .cse19 (store (select .cse24 .cse19) v_subst_2 v_ArrVal_3210))))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse16) (= (select (select .cse17 .cse16) 4) 0) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse21 (select (select (let ((.cse22 (store (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3191))) (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3197))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse22 .cse19 (store (select .cse22 .cse19) v_subst_2 v_ArrVal_3209))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (< (select (select (let ((.cse18 (store (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3193))) (store .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse6 v_ArrVal_3198))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse18 .cse19 (store (select .cse18 .cse19) v_subst_2 v_ArrVal_3206))) .cse16) .cse21) .cse7) (not (= .cse21 0)))))))))))))) is different from false [2022-11-18 19:56:46,897 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8)) (.cse14 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse15 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_3194 Int) (v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3199 Int) (v_ArrVal_3210 Int) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3197 Int) (v_subst_2 Int) (v_ArrVal_3198 Int) (v_ArrVal_3193 (Array Int Int))) (let ((.cse11 (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse14 .cse15 v_ArrVal_3194)))) (store .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse13 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_3199))))) (let ((.cse12 (select .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse9 (let ((.cse10 (store .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse12 0 v_ArrVal_3203)))) (store .cse10 .cse1 (store (select .cse10 .cse1) v_subst_2 v_ArrVal_3210))))) (let ((.cse4 (select (select .cse9 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse5 (select (select (let ((.cse7 (store (let ((.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3191))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_3197))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse7 .cse1 (store (select .cse7 .cse1) v_subst_2 v_ArrVal_3209))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (< (select (select (let ((.cse0 (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3193))) (store .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_3198))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse0 .cse1 (store (select .cse0 .cse1) v_subst_2 v_ArrVal_3206))) .cse4) .cse5) .cse6) (not (= .cse5 0))))) (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (select (select .cse9 .cse4) 4) 0)))))))) (forall ((v_ArrVal_3194 Int) (v_ArrVal_3203 Int) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int)) (v_ArrVal_3199 Int) (v_ArrVal_3210 Int) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3197 Int) (v_ArrVal_3198 Int) (v_subst_1 Int) (v_ArrVal_3193 (Array Int Int))) (let ((.cse25 (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse14 .cse15 v_ArrVal_3194)))) (store .cse27 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse27 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_3199))))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse17 (select .cse26 4))) (let ((.cse19 (select (select (let ((.cse24 (store .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse26 0 v_ArrVal_3203)))) (store .cse24 .cse17 (store (select .cse24 .cse17) v_subst_1 v_ArrVal_3210))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int)) (let ((.cse21 (let ((.cse22 (store (let ((.cse23 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3191))) (store .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse23 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_3197))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse22 .cse17 (store (select .cse22 .cse17) v_subst_1 v_ArrVal_3209))))) (let ((.cse20 (select (select .cse21 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (< (select (select (let ((.cse16 (store (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3193))) (store .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse18 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse3 v_ArrVal_3198))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse16 .cse17 (store (select .cse16 .cse17) v_subst_1 v_ArrVal_3206))) .cse19) .cse20) .cse6) (= (select (select .cse21 .cse19) 4) 0) (not (= .cse20 0)))))) (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))) is different from false [2022-11-18 19:56:46,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:46,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1292 treesize of output 788 [2022-11-18 19:56:47,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:56:47,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1414 treesize of output 830 [2022-11-18 19:56:47,189 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse8 (+ |c_ULTIMATE.start_main_~len~0#1| 1)) (.cse7 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_3209 Int) (v_arrayElimArr_21 (Array Int Int)) (v_ArrVal_3206 Int) (v_ArrVal_3203 Int) (v_ArrVal_3199 Int) (v_ArrVal_3210 Int) (v_subst_2 Int) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3197 Int) (v_ArrVal_3198 Int) (v_ArrVal_3193 (Array Int Int)) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int))) (let ((.cse12 (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_21))) (store .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_3199))))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse5 (select .cse13 4))) (let ((.cse2 (let ((.cse11 (store .cse12 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse13 0 v_ArrVal_3203)))) (store .cse11 .cse5 (store (select .cse11 .cse5) v_subst_2 v_ArrVal_3210))))) (let ((.cse0 (select (select (let ((.cse9 (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3191))) (store .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse10 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_3197))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse9 .cse5 (store (select .cse9 .cse5) v_subst_2 v_ArrVal_3209))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= .cse0 0)) (not (= (select v_arrayElimArr_21 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select (select .cse2 .cse3) 4) 0) (< (select (select (let ((.cse4 (store (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3193))) (store .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_3198))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse4 .cse5 (store (select .cse4 .cse5) v_subst_2 v_ArrVal_3206))) .cse3) .cse0) .cse8) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) (forall ((v_ArrVal_3209 Int) (v_ArrVal_3206 Int) (v_ArrVal_3203 Int) (v_ArrVal_3199 Int) (v_ArrVal_3210 Int) (v_ArrVal_3191 (Array Int Int)) (v_ArrVal_3197 Int) (v_ArrVal_3198 Int) (v_subst_1 Int) (v_ArrVal_3193 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_ArrVal_3201 (Array Int Int)) (v_ArrVal_3204 (Array Int Int))) (let ((.cse22 (let ((.cse26 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_20))) (store .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_3199))))) (let ((.cse23 (select .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse19 (select .cse23 4))) (let ((.cse16 (let ((.cse24 (store (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3191))) (store .cse25 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse25 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_3197))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3204))) (store .cse24 .cse19 (store (select .cse24 .cse19) v_subst_1 v_ArrVal_3209))))) (let ((.cse17 (select (select (let ((.cse21 (store .cse22 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse23 0 v_ArrVal_3203)))) (store .cse21 .cse19 (store (select .cse21 .cse19) v_subst_1 v_ArrVal_3210))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (.cse15 (select (select .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (or (not (= .cse15 0)) (= (select (select .cse16 .cse17) 4) 0) (not (= (select v_arrayElimArr_20 .cse1) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (< (select (select (let ((.cse18 (store (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3193))) (store .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse7 v_ArrVal_3198))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_3201))) (store .cse18 .cse19 (store (select .cse18 .cse19) v_subst_1 v_ArrVal_3206))) .cse17) .cse15) .cse8)))))))))) is different from false [2022-11-18 19:57:05,081 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:05,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 1894 treesize of output 1014 [2022-11-18 19:57:05,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:08,498 INFO L321 Elim1Store]: treesize reduction 631, result has 29.2 percent of original size [2022-11-18 19:57:08,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 16 new quantified variables, introduced 65 case distinctions, treesize of input 290006 treesize of output 252663 [2022-11-18 19:57:12,784 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 19:57:12,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14342 treesize of output 10762 [2022-11-18 19:57:14,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 19:57:14,978 INFO L321 Elim1Store]: treesize reduction 15, result has 71.7 percent of original size [2022-11-18 19:57:14,981 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 693218 treesize of output 689673 [2022-11-18 19:57:16,509 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 833616 treesize of output 825432 [2022-11-18 19:57:18,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 993704 treesize of output 992204 [2022-11-18 19:57:20,013 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 2658453 treesize of output 2593239 [2022-11-18 19:57:54,880 WARN L233 SmtUtils]: Spent 34.86s on a formula simplification. DAG size of input: 3609 DAG size of output: 3596 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 19:58:49,734 WARN L233 SmtUtils]: Spent 54.83s on a formula simplification. DAG size of input: 3553 DAG size of output: 3538 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 19:59:18,561 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-18 20:00:26,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:00:26,677 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-18 20:00:26,932 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-18 20:00:26,957 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-18 20:00:27,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:27,082 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 42 treesize of output 40 [2022-11-18 20:00:27,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-18 20:00:27,455 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 103 treesize of output 99 [2022-11-18 20:00:29,887 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-18 20:00:29,889 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 1537402 treesize of output 1536628 [2022-11-18 20:00:43,531 WARN L233 SmtUtils]: Spent 8.18s on a formula simplification. DAG size of input: 959 DAG size of output: 958 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:00:53,216 WARN L233 SmtUtils]: Spent 8.55s on a formula simplification. DAG size of input: 957 DAG size of output: 957 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:01:15,538 WARN L233 SmtUtils]: Spent 10.29s on a formula simplification. DAG size of input: 850 DAG size of output: 850 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:01:33,600 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification. DAG size of input: 700 DAG size of output: 700 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-11-18 20:01:55,287 WARN L233 SmtUtils]: Spent 5.11s on a formula simplification. DAG size of input: 696 DAG size of output: 696 (called from [L 800] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)