./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a 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_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc --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 e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- 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-5e519f3 [2022-11-02 20:53:02,581 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:53:02,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:53:02,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:53:02,624 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:53:02,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:53:02,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:53:02,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:53:02,630 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:53:02,631 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:53:02,632 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:53:02,633 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:53:02,633 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:53:02,635 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:53:02,636 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:53:02,637 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:53:02,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:53:02,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:53:02,641 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:53:02,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:53:02,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:53:02,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:53:02,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:53:02,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:53:02,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:53:02,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:53:02,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:53:02,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:53:02,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:53:02,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:53:02,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:53:02,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:53:02,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:53:02,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:53:02,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:53:02,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:53:02,662 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:53:02,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:53:02,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:53:02,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:53:02,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:53:02,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:53:02,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:53:02,704 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:53:02,705 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:53:02,705 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:53:02,707 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:53:02,707 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:53:02,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:53:02,708 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:53:02,709 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:53:02,709 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:53:02,710 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:53:02,710 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:53:02,710 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:53:02,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:53:02,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:53:02,711 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:53:02,711 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:53:02,712 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:53:02,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:53:02,712 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:53:02,712 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:53:02,712 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:53:02,713 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:53:02,713 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:53:02,713 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:53:02,713 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:02,714 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:53:02,714 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:53:02,714 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:53:02,714 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:53:02,715 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_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/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_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc 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 -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2022-11-02 20:53:03,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:53:03,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:53:03,044 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:53:03,047 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:53:03,048 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:53:03,049 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2022-11-02 20:53:03,132 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/data/cdd99b3cd/2811afdd2797490d84ba49ac6f51bd53/FLAGd84c76b1a [2022-11-02 20:53:03,651 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:53:03,651 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2022-11-02 20:53:03,663 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/data/cdd99b3cd/2811afdd2797490d84ba49ac6f51bd53/FLAGd84c76b1a [2022-11-02 20:53:03,956 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/data/cdd99b3cd/2811afdd2797490d84ba49ac6f51bd53 [2022-11-02 20:53:03,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:53:03,960 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:53:03,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:03,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:53:03,969 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:53:03,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:03" (1/1) ... [2022-11-02 20:53:03,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d74d59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:03, skipping insertion in model container [2022-11-02 20:53:03,971 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:53:03" (1/1) ... [2022-11-02 20:53:03,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:53:04,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:53:04,467 WARN L230 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_9e57b604-adba-4f67-9f16-afdd7325db2a/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2022-11-02 20:53:04,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:04,487 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:53:04,540 WARN L230 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_9e57b604-adba-4f67-9f16-afdd7325db2a/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2022-11-02 20:53:04,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:53:04,567 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:53:04,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04 WrapperNode [2022-11-02 20:53:04,568 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:53:04,569 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:04,569 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:53:04,569 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:53:04,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,590 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,620 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 140 [2022-11-02 20:53:04,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:53:04,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:53:04,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:53:04,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:53:04,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,647 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,649 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:53:04,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:53:04,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:53:04,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:53:04,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (1/1) ... [2022-11-02 20:53:04,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:53:04,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:04,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:53:04,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:53:04,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:53:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:53:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-02 20:53:04,730 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-02 20:53:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:53:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:53:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 20:53:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:53:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:53:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:53:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 20:53:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:53:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:53:04,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:53:04,850 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:53:04,852 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:53:05,353 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:53:05,373 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:53:05,374 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-02 20:53:05,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:05 BoogieIcfgContainer [2022-11-02 20:53:05,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:53:05,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:53:05,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:53:05,432 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:53:05,432 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:53:03" (1/3) ... [2022-11-02 20:53:05,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22db9c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:05, skipping insertion in model container [2022-11-02 20:53:05,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:53:04" (2/3) ... [2022-11-02 20:53:05,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22db9c6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:53:05, skipping insertion in model container [2022-11-02 20:53:05,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:53:05" (3/3) ... [2022-11-02 20:53:05,463 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2022-11-02 20:53:05,511 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:53:05,512 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-11-02 20:53:05,591 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:53:05,598 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;@326ff7f3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:53:05,599 INFO L358 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-11-02 20:53:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:53:05,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:05,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:53:05,613 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:05,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:05,619 INFO L85 PathProgramCache]: Analyzing trace with hash 895303154, now seen corresponding path program 1 times [2022-11-02 20:53:05,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:05,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235774908] [2022-11-02 20:53:05,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:05,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:05,968 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-02 20:53:05,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:05,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235774908] [2022-11-02 20:53:05,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235774908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:05,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:05,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080555300] [2022-11-02 20:53:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:05,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:06,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:06,025 INFO L87 Difference]: Start difference. First operand has 130 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 125 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:06,278 INFO L93 Difference]: Finished difference Result 127 states and 136 transitions. [2022-11-02 20:53:06,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:06,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:53:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:06,290 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:53:06,293 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:53:06,295 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-02 20:53:06,300 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:06,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:06,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:53:06,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-11-02 20:53:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 63 states have (on average 2.0) internal successors, (126), 119 states have internal predecessors, (126), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:06,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2022-11-02 20:53:06,378 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 6 [2022-11-02 20:53:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:06,379 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2022-11-02 20:53:06,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2022-11-02 20:53:06,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-02 20:53:06,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:06,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-02 20:53:06,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:53:06,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:06,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:06,385 INFO L85 PathProgramCache]: Analyzing trace with hash 895303155, now seen corresponding path program 1 times [2022-11-02 20:53:06,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:06,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504124142] [2022-11-02 20:53:06,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:06,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,561 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-02 20:53:06,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:06,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504124142] [2022-11-02 20:53:06,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504124142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:06,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:06,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:53:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910839221] [2022-11-02 20:53:06,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:06,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:53:06,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:06,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:53:06,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:53:06,565 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:06,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:06,690 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-11-02 20:53:06,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:53:06,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-02 20:53:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:06,692 INFO L225 Difference]: With dead ends: 121 [2022-11-02 20:53:06,693 INFO L226 Difference]: Without dead ends: 121 [2022-11-02 20:53:06,712 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-02 20:53:06,714 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 5 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:06,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 195 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:06,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-02 20:53:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-11-02 20:53:06,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 63 states have (on average 1.9523809523809523) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:06,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-11-02 20:53:06,730 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 6 [2022-11-02 20:53:06,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:06,733 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-11-02 20:53:06,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:53:06,734 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-11-02 20:53:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:53:06,736 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:06,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:06,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:53:06,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:06,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1495162356, now seen corresponding path program 1 times [2022-11-02 20:53:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:06,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978990440] [2022-11-02 20:53:06,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:06,928 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-02 20:53:06,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:06,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978990440] [2022-11-02 20:53:06,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978990440] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:06,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:06,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:53:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230006638] [2022-11-02 20:53:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:06,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:06,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:06,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:06,933 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:07,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:07,102 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-11-02 20:53:07,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:07,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-02 20:53:07,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:07,107 INFO L225 Difference]: With dead ends: 132 [2022-11-02 20:53:07,107 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 20:53:07,108 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:53:07,115 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 10 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:07,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 292 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:07,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 20:53:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 122. [2022-11-02 20:53:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.9375) internal successors, (124), 117 states have internal predecessors, (124), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2022-11-02 20:53:07,130 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2022-11-02 20:53:07,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:07,131 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2022-11-02 20:53:07,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-02 20:53:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2022-11-02 20:53:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:53:07,136 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:07,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:07,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:53:07,137 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:07,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:07,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192736, now seen corresponding path program 1 times [2022-11-02 20:53:07,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:07,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128145174] [2022-11-02 20:53:07,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:07,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:07,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:07,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:07,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128145174] [2022-11-02 20:53:07,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128145174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:07,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:07,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:53:07,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33362305] [2022-11-02 20:53:07,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:07,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:07,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:07,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:07,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:07,521 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:53:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:07,872 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2022-11-02 20:53:07,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:07,873 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-02 20:53:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:07,875 INFO L225 Difference]: With dead ends: 122 [2022-11-02 20:53:07,875 INFO L226 Difference]: Without dead ends: 122 [2022-11-02 20:53:07,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:07,877 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 21 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:07,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 394 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:07,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-02 20:53:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2022-11-02 20:53:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 64 states have (on average 1.921875) internal successors, (123), 116 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:07,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2022-11-02 20:53:07,884 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 24 [2022-11-02 20:53:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:07,884 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2022-11-02 20:53:07,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:53:07,885 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2022-11-02 20:53:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-02 20:53:07,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:07,886 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:07,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:53:07,886 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:07,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash 2091192737, now seen corresponding path program 1 times [2022-11-02 20:53:07,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:07,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046619231] [2022-11-02 20:53:07,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:07,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:08,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:08,210 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:08,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:08,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046619231] [2022-11-02 20:53:08,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046619231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:08,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:08,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:53:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630238848] [2022-11-02 20:53:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:08,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:08,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:08,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:08,213 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:53:08,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:08,533 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2022-11-02 20:53:08,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:08,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-02 20:53:08,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:08,535 INFO L225 Difference]: With dead ends: 121 [2022-11-02 20:53:08,535 INFO L226 Difference]: Without dead ends: 121 [2022-11-02 20:53:08,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:08,536 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 19 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:08,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 418 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:08,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-02 20:53:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2022-11-02 20:53:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.90625) internal successors, (122), 115 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:08,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2022-11-02 20:53:08,543 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 24 [2022-11-02 20:53:08,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:08,543 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2022-11-02 20:53:08,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:53:08,544 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2022-11-02 20:53:08,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:53:08,544 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:08,545 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:08,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:53:08,545 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:08,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash -408475519, now seen corresponding path program 1 times [2022-11-02 20:53:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:08,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892886349] [2022-11-02 20:53:08,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:08,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:08,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:08,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:08,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:08,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:08,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892886349] [2022-11-02 20:53:08,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892886349] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:08,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202210422] [2022-11-02 20:53:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:08,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:08,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:53:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:09,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:53:09,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:09,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:09,232 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:53:09,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:09,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:09,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202210422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:09,308 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:09,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-11-02 20:53:09,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308744962] [2022-11-02 20:53:09,308 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:09,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:53:09,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:09,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:53:09,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:53:09,310 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:09,704 INFO L93 Difference]: Finished difference Result 145 states and 156 transitions. [2022-11-02 20:53:09,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:09,705 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-11-02 20:53:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:09,706 INFO L225 Difference]: With dead ends: 145 [2022-11-02 20:53:09,706 INFO L226 Difference]: Without dead ends: 145 [2022-11-02 20:53:09,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-11-02 20:53:09,707 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 102 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:09,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 414 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 388 Invalid, 0 Unknown, 75 Unchecked, 0.3s Time] [2022-11-02 20:53:09,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-11-02 20:53:09,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 125. [2022-11-02 20:53:09,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 119 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:53:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-11-02 20:53:09,714 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 26 [2022-11-02 20:53:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:09,715 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-11-02 20:53:09,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 8 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-11-02 20:53:09,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:53:09,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:09,717 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:09,756 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:09,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:09,957 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:09,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:09,957 INFO L85 PathProgramCache]: Analyzing trace with hash -408475518, now seen corresponding path program 1 times [2022-11-02 20:53:09,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:09,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294761216] [2022-11-02 20:53:09,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:09,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:10,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:10,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:10,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:10,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:10,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:10,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:10,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294761216] [2022-11-02 20:53:10,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294761216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:10,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799950057] [2022-11-02 20:53:10,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:10,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:10,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:10,556 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:10,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:53:10,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:10,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-02 20:53:10,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:10,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:10,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:10,994 INFO L356 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-11-02 20:53:10,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2022-11-02 20:53:11,013 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:53:11,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:11,072 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:13,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799950057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:13,276 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:13,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-11-02 20:53:13,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785859325] [2022-11-02 20:53:13,276 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:13,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:53:13,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:13,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:53:13,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-11-02 20:53:13,278 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:53:14,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:14,168 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-11-02 20:53:14,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:53:14,169 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 26 [2022-11-02 20:53:14,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:14,170 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:53:14,170 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:53:14,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:53:14,171 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 16 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:14,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 600 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:53:14,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:53:14,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2022-11-02 20:53:14,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 119 states have internal predecessors, (127), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:53:14,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 135 transitions. [2022-11-02 20:53:14,176 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 135 transitions. Word has length 26 [2022-11-02 20:53:14,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:14,177 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 135 transitions. [2022-11-02 20:53:14,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.111111111111111) internal successors, (38), 14 states have internal predecessors, (38), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-02 20:53:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 135 transitions. [2022-11-02 20:53:14,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:53:14,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:14,178 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:14,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:14,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-02 20:53:14,379 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:14,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1702795689, now seen corresponding path program 1 times [2022-11-02 20:53:14,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:14,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829719872] [2022-11-02 20:53:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:14,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:14,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:14,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829719872] [2022-11-02 20:53:14,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829719872] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:14,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37475674] [2022-11-02 20:53:14,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:14,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:14,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:14,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:53:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:14,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:53:14,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:14,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:14,801 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:14,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37475674] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:14,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:14,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 7 [2022-11-02 20:53:14,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810760885] [2022-11-02 20:53:14,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:14,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:14,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:14,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:14,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:14,894 INFO L87 Difference]: Start difference. First operand 125 states and 135 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:53:15,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:15,097 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-11-02 20:53:15,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:15,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2022-11-02 20:53:15,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:15,099 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:53:15,099 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:53:15,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:15,100 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 4 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:15,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 612 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:53:15,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2022-11-02 20:53:15,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.8529411764705883) internal successors, (126), 119 states have internal predecessors, (126), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:53:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 134 transitions. [2022-11-02 20:53:15,105 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 134 transitions. Word has length 28 [2022-11-02 20:53:15,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:15,106 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 134 transitions. [2022-11-02 20:53:15,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-02 20:53:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 134 transitions. [2022-11-02 20:53:15,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:53:15,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:15,107 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:15,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:15,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-02 20:53:15,312 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:15,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:15,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839470, now seen corresponding path program 1 times [2022-11-02 20:53:15,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:15,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168346660] [2022-11-02 20:53:15,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:15,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:15,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:15,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:53:15,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:15,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168346660] [2022-11-02 20:53:15,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168346660] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:15,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935939016] [2022-11-02 20:53:15,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:15,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:15,470 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:15,472 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:15,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:53:15,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:15,629 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-02 20:53:15,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:15,652 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:53:15,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:15,667 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:53:15,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-11-02 20:53:15,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:53:15,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935939016] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:15,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:15,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 5 [2022-11-02 20:53:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402308911] [2022-11-02 20:53:15,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:15,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:15,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:15,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:15,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:15,695 INFO L87 Difference]: Start difference. First operand 125 states and 134 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:15,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:15,941 INFO L93 Difference]: Finished difference Result 130 states and 141 transitions. [2022-11-02 20:53:15,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:15,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-11-02 20:53:15,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:15,943 INFO L225 Difference]: With dead ends: 130 [2022-11-02 20:53:15,943 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 20:53:15,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:15,944 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 13 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:15,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 289 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:15,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 20:53:15,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2022-11-02 20:53:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8450704225352113) internal successors, (131), 122 states have internal predecessors, (131), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:53:15,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2022-11-02 20:53:15,952 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 29 [2022-11-02 20:53:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:15,953 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2022-11-02 20:53:15,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:15,954 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2022-11-02 20:53:15,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:53:15,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:15,956 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:15,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:16,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:16,157 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:16,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:16,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1251839469, now seen corresponding path program 1 times [2022-11-02 20:53:16,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:16,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821408421] [2022-11-02 20:53:16,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:16,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,424 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-02 20:53:16,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821408421] [2022-11-02 20:53:16,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821408421] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:16,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724250894] [2022-11-02 20:53:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:16,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:16,426 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:16,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:16,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:53:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:16,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-02 20:53:16,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:16,747 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-02 20:53:16,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:16,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:16,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-11-02 20:53:16,970 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-02 20:53:16,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724250894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:53:16,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:53:16,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2022-11-02 20:53:16,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340748411] [2022-11-02 20:53:16,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:16,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:53:16,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:16,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:53:16,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:16,973 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-02 20:53:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:17,360 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-11-02 20:53:17,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:53:17,361 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 29 [2022-11-02 20:53:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:17,362 INFO L225 Difference]: With dead ends: 135 [2022-11-02 20:53:17,362 INFO L226 Difference]: Without dead ends: 135 [2022-11-02 20:53:17,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:53:17,363 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 33 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:17,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 1200 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-02 20:53:17,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2022-11-02 20:53:17,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 122 states have internal predecessors, (130), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:53:17,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 138 transitions. [2022-11-02 20:53:17,367 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 138 transitions. Word has length 29 [2022-11-02 20:53:17,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:17,368 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 138 transitions. [2022-11-02 20:53:17,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 13 states have internal predecessors, (51), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-11-02 20:53:17,368 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 138 transitions. [2022-11-02 20:53:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:53:17,369 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:17,369 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:17,404 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:17,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:17,570 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:17,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:17,570 INFO L85 PathProgramCache]: Analyzing trace with hash -152317901, now seen corresponding path program 1 times [2022-11-02 20:53:17,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:17,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275144400] [2022-11-02 20:53:17,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:17,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:17,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:17,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:17,735 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-02 20:53:17,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:17,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275144400] [2022-11-02 20:53:17,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275144400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:17,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:17,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:53:17,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210797115] [2022-11-02 20:53:17,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:17,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:53:17,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:17,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:53:17,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:17,738 INFO L87 Difference]: Start difference. First operand 128 states and 138 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:53:18,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:18,104 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2022-11-02 20:53:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:53:18,105 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-02 20:53:18,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:18,106 INFO L225 Difference]: With dead ends: 128 [2022-11-02 20:53:18,106 INFO L226 Difference]: Without dead ends: 128 [2022-11-02 20:53:18,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:18,107 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 23 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:18,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 438 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-02 20:53:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2022-11-02 20:53:18,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8169014084507042) internal successors, (129), 121 states have internal predecessors, (129), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:53:18,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-11-02 20:53:18,111 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 30 [2022-11-02 20:53:18,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:18,112 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-11-02 20:53:18,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:53:18,112 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-11-02 20:53:18,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:53:18,113 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:18,113 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:18,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:53:18,113 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:18,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:18,114 INFO L85 PathProgramCache]: Analyzing trace with hash -152317900, now seen corresponding path program 1 times [2022-11-02 20:53:18,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:18,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806465216] [2022-11-02 20:53:18,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:18,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:18,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:18,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:18,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:18,533 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-02 20:53:18,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:18,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806465216] [2022-11-02 20:53:18,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806465216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:18,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:18,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:53:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091781042] [2022-11-02 20:53:18,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:18,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:53:18,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:53:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:18,537 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:53:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:18,954 INFO L93 Difference]: Finished difference Result 126 states and 136 transitions. [2022-11-02 20:53:18,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:53:18,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2022-11-02 20:53:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:18,956 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:53:18,956 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:53:18,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:18,957 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 20 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:18,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 468 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:53:18,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:53:18,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-02 20:53:18,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 71 states have (on average 1.8028169014084507) internal successors, (128), 120 states have internal predecessors, (128), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-02 20:53:18,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-11-02 20:53:18,965 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 30 [2022-11-02 20:53:18,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:18,965 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-11-02 20:53:18,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-02 20:53:18,966 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-11-02 20:53:18,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:53:18,968 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:18,968 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:18,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:53:18,969 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:18,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:18,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1115824007, now seen corresponding path program 1 times [2022-11-02 20:53:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:18,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073741494] [2022-11-02 20:53:18,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:18,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-02 20:53:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,167 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-02 20:53:19,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:19,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073741494] [2022-11-02 20:53:19,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073741494] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:19,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302523600] [2022-11-02 20:53:19,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:19,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:19,169 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:19,170 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:19,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:53:19,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:19,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:53:19,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:53:19,451 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:19,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302523600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:19,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:53:19,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-02 20:53:19,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84463078] [2022-11-02 20:53:19,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:19,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:53:19,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:19,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:53:19,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:19,454 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:19,471 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2022-11-02 20:53:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:53:19,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-11-02 20:53:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:19,472 INFO L225 Difference]: With dead ends: 114 [2022-11-02 20:53:19,473 INFO L226 Difference]: Without dead ends: 114 [2022-11-02 20:53:19,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:19,474 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 196 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 133 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-02 20:53:19,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 133 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:53:19,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-02 20:53:19,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-02 20:53:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 64 states have (on average 1.78125) internal successors, (114), 109 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2022-11-02 20:53:19,478 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 41 [2022-11-02 20:53:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:19,479 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2022-11-02 20:53:19,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2022-11-02 20:53:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:53:19,480 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:19,480 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:19,523 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:19,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-02 20:53:19,700 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:19,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:19,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195673, now seen corresponding path program 1 times [2022-11-02 20:53:19,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:19,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722280818] [2022-11-02 20:53:19,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:19,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:20,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:20,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-02 20:53:20,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:20,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722280818] [2022-11-02 20:53:20,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722280818] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:20,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789567144] [2022-11-02 20:53:20,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:20,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:20,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:20,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:20,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:53:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:20,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 22 conjunts are in the unsatisfiable core [2022-11-02 20:53:20,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:20,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:20,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:53:20,739 WARN L833 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2022-11-02 20:53:20,745 WARN L855 $PredicateComparison]: unable to prove that (and (or (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ .cse0 1) |c_#StackHeapBarrier|))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2022-11-02 20:53:20,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:53:20,846 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:53:20,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:53:20,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:53:21,070 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:53:21,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:21,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789567144] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:21,150 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:21,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2022-11-02 20:53:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917901382] [2022-11-02 20:53:21,150 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:21,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-02 20:53:21,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:21,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-02 20:53:21,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=146, Unknown=2, NotChecked=24, Total=210 [2022-11-02 20:53:21,152 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand has 14 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:53:21,246 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ .cse1 1) |c_#StackHeapBarrier|))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2022-11-02 20:53:21,250 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (and .cse0 (or .cse0 (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_6| .cse1 (select |c_#valid| .cse1))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (<= (+ .cse1 1) |c_#StackHeapBarrier|))))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2022-11-02 20:53:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:21,651 INFO L93 Difference]: Finished difference Result 125 states and 132 transitions. [2022-11-02 20:53:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:53:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-11-02 20:53:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:21,652 INFO L225 Difference]: With dead ends: 125 [2022-11-02 20:53:21,652 INFO L226 Difference]: Without dead ends: 125 [2022-11-02 20:53:21,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=245, Unknown=4, NotChecked=66, Total=380 [2022-11-02 20:53:21,653 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 125 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:21,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 363 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 372 Invalid, 0 Unknown, 193 Unchecked, 0.4s Time] [2022-11-02 20:53:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-02 20:53:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2022-11-02 20:53:21,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 64 states have (on average 1.671875) internal successors, (107), 102 states have internal predecessors, (107), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2022-11-02 20:53:21,656 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 43 [2022-11-02 20:53:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:21,657 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2022-11-02 20:53:21,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.5) internal successors, (54), 11 states have internal predecessors, (54), 3 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-11-02 20:53:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2022-11-02 20:53:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-02 20:53:21,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:21,658 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:21,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:21,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-02 20:53:21,872 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:21,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:21,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1638195672, now seen corresponding path program 1 times [2022-11-02 20:53:21,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:21,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706156630] [2022-11-02 20:53:21,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:22,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:22,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:22,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:22,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:53:22,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:22,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706156630] [2022-11-02 20:53:22,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706156630] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:22,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620964744] [2022-11-02 20:53:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:22,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:22,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:22,627 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:22,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:53:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:22,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-02 20:53:22,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:22,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:22,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:53:24,651 WARN L833 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2022-11-02 20:53:24,654 WARN L855 $PredicateComparison]: unable to prove that (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2022-11-02 20:53:24,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:53:26,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:26,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:26,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:53:27,085 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 7 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:53:27,085 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:27,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620964744] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:27,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:27,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2022-11-02 20:53:27,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092144864] [2022-11-02 20:53:27,225 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:27,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-11-02 20:53:27,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:27,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-11-02 20:53:27,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=246, Unknown=3, NotChecked=32, Total=342 [2022-11-02 20:53:27,227 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 17 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:53:27,336 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 4))) is different from false [2022-11-02 20:53:27,339 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (< |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 4 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_main_~#s~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0)))))) (<= 4 .cse1)) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 4))) is different from true [2022-11-02 20:53:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:27,880 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-11-02 20:53:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:53:27,881 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2022-11-02 20:53:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:27,882 INFO L225 Difference]: With dead ends: 117 [2022-11-02 20:53:27,882 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 20:53:27,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=92, Invalid=331, Unknown=5, NotChecked=78, Total=506 [2022-11-02 20:53:27,883 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 419 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 107 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:27,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 284 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 473 Invalid, 0 Unknown, 107 Unchecked, 0.6s Time] [2022-11-02 20:53:27,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 20:53:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 99. [2022-11-02 20:53:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.546875) internal successors, (99), 94 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:27,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2022-11-02 20:53:27,887 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 43 [2022-11-02 20:53:27,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:27,888 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2022-11-02 20:53:27,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 4.461538461538462) internal successors, (58), 14 states have internal predecessors, (58), 5 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:53:27,888 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2022-11-02 20:53:27,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:53:27,889 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:27,889 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:27,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:28,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:53:28,115 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:28,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:28,116 INFO L85 PathProgramCache]: Analyzing trace with hash 226108014, now seen corresponding path program 1 times [2022-11-02 20:53:28,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:28,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23119383] [2022-11-02 20:53:28,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:28,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:28,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:28,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-02 20:53:28,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:28,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23119383] [2022-11-02 20:53:28,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23119383] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:28,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:28,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:53:28,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539709624] [2022-11-02 20:53:28,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:28,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:28,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:28,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:28,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:28,334 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:53:28,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:28,605 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-11-02 20:53:28,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:28,606 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-11-02 20:53:28,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:28,606 INFO L225 Difference]: With dead ends: 113 [2022-11-02 20:53:28,607 INFO L226 Difference]: Without dead ends: 113 [2022-11-02 20:53:28,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:28,607 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 69 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:28,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 259 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:53:28,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-02 20:53:28,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 95. [2022-11-02 20:53:28,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 64 states have (on average 1.484375) internal successors, (95), 90 states have internal predecessors, (95), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:28,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2022-11-02 20:53:28,611 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 46 [2022-11-02 20:53:28,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:28,611 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2022-11-02 20:53:28,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:53:28,612 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2022-11-02 20:53:28,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:53:28,612 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:28,612 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:28,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:53:28,613 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:28,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:28,613 INFO L85 PathProgramCache]: Analyzing trace with hash 226108015, now seen corresponding path program 1 times [2022-11-02 20:53:28,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:28,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314681498] [2022-11-02 20:53:28,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:28,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:28,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:53:28,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:28,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314681498] [2022-11-02 20:53:28,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314681498] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:28,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:28,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:53:28,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245463649] [2022-11-02 20:53:28,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:28,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:28,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:28,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:28,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:28,976 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:53:29,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:29,234 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-02 20:53:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:53:29,235 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2022-11-02 20:53:29,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:29,235 INFO L225 Difference]: With dead ends: 91 [2022-11-02 20:53:29,236 INFO L226 Difference]: Without dead ends: 91 [2022-11-02 20:53:29,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:53:29,236 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 68 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:29,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 274 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-02 20:53:29,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-11-02 20:53:29,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.421875) internal successors, (91), 86 states have internal predecessors, (91), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:29,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 97 transitions. [2022-11-02 20:53:29,240 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 97 transitions. Word has length 46 [2022-11-02 20:53:29,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:29,240 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 97 transitions. [2022-11-02 20:53:29,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:53:29,241 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 97 transitions. [2022-11-02 20:53:29,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:53:29,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:29,241 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:29,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:53:29,242 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:29,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:29,242 INFO L85 PathProgramCache]: Analyzing trace with hash 226118937, now seen corresponding path program 1 times [2022-11-02 20:53:29,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:29,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643412546] [2022-11-02 20:53:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:29,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:29,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:29,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:29,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:30,205 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:53:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643412546] [2022-11-02 20:53:30,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643412546] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:30,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [877127764] [2022-11-02 20:53:30,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:30,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:30,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:30,210 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:30,216 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:53:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:30,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 40 conjunts are in the unsatisfiable core [2022-11-02 20:53:30,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:30,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:30,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-02 20:53:31,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:31,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:53:31,206 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-02 20:53:31,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:31,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:53:31,333 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:31,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:31,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_48| Int) (v_ArrVal_2374 (Array Int Int))) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_48| 1) (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_48| v_ArrVal_2374) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) 1) (not (< |v_node_create_~temp~0#1.base_48| |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:53:31,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [877127764] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:31,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:31,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 26 [2022-11-02 20:53:31,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892372285] [2022-11-02 20:53:31,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:31,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:53:31,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:31,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:53:31,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=620, Unknown=3, NotChecked=50, Total=756 [2022-11-02 20:53:31,404 INFO L87 Difference]: Start difference. First operand 91 states and 97 transitions. Second operand has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:53:32,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:32,250 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2022-11-02 20:53:32,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:53:32,251 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-02 20:53:32,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:32,252 INFO L225 Difference]: With dead ends: 90 [2022-11-02 20:53:32,252 INFO L226 Difference]: Without dead ends: 90 [2022-11-02 20:53:32,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=136, Invalid=918, Unknown=6, NotChecked=62, Total=1122 [2022-11-02 20:53:32,253 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 24 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:32,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 799 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 696 Invalid, 0 Unknown, 103 Unchecked, 0.6s Time] [2022-11-02 20:53:32,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-11-02 20:53:32,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-11-02 20:53:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.40625) internal successors, (90), 85 states have internal predecessors, (90), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:32,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-11-02 20:53:32,256 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 46 [2022-11-02 20:53:32,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:32,256 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-11-02 20:53:32,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.75) internal successors, (66), 23 states have internal predecessors, (66), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:53:32,257 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-11-02 20:53:32,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-02 20:53:32,257 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:32,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:32,298 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:32,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:53:32,472 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:32,472 INFO L85 PathProgramCache]: Analyzing trace with hash 226118938, now seen corresponding path program 1 times [2022-11-02 20:53:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:32,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285943141] [2022-11-02 20:53:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:32,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:32,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:33,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:33,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,312 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:34,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:34,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285943141] [2022-11-02 20:53:34,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285943141] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:34,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428557869] [2022-11-02 20:53:34,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:34,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:34,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:34,313 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:34,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:53:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:34,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-02 20:53:34,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:34,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:35,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-02 20:53:35,163 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:53:35,417 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2614 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_ArrVal_2613 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_2613)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_2614)))) is different from true [2022-11-02 20:53:35,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:35,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-02 20:53:35,508 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:53:35,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:53:35,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:35,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-11-02 20:53:35,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2022-11-02 20:53:35,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:35,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:53:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-02 20:53:35,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:36,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428557869] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:36,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:36,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 26 [2022-11-02 20:53:36,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847438159] [2022-11-02 20:53:36,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:36,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-02 20:53:36,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:36,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-02 20:53:36,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=720, Unknown=1, NotChecked=54, Total=870 [2022-11-02 20:53:36,188 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 27 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 23 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:53:37,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:37,449 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2022-11-02 20:53:37,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:53:37,450 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 23 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 46 [2022-11-02 20:53:37,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:37,450 INFO L225 Difference]: With dead ends: 89 [2022-11-02 20:53:37,450 INFO L226 Difference]: Without dead ends: 89 [2022-11-02 20:53:37,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 39 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=175, Invalid=1160, Unknown=1, NotChecked=70, Total=1406 [2022-11-02 20:53:37,452 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 168 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 642 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 642 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:37,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 472 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 642 Invalid, 0 Unknown, 92 Unchecked, 0.8s Time] [2022-11-02 20:53:37,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-11-02 20:53:37,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-11-02 20:53:37,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 64 states have (on average 1.390625) internal successors, (89), 84 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:37,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2022-11-02 20:53:37,455 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 46 [2022-11-02 20:53:37,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:37,455 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2022-11-02 20:53:37,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 2.7083333333333335) internal successors, (65), 23 states have internal predecessors, (65), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:53:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2022-11-02 20:53:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-02 20:53:37,456 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:37,456 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:37,497 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:37,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:37,657 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:37,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1475150796, now seen corresponding path program 1 times [2022-11-02 20:53:37,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:37,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327446235] [2022-11-02 20:53:37,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:37,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:37,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:37,816 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:53:37,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:37,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327446235] [2022-11-02 20:53:37,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327446235] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:37,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:37,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:53:37,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117703432] [2022-11-02 20:53:37,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:37,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:37,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:37,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:37,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:37,819 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:37,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:37,939 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-11-02 20:53:37,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:53:37,939 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2022-11-02 20:53:37,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:37,940 INFO L225 Difference]: With dead ends: 106 [2022-11-02 20:53:37,940 INFO L226 Difference]: Without dead ends: 106 [2022-11-02 20:53:37,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:53:37,941 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 197 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:37,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 155 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:37,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-02 20:53:37,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2022-11-02 20:53:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 64 states have (on average 1.375) internal successors, (88), 83 states have internal predecessors, (88), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:37,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-11-02 20:53:37,944 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 49 [2022-11-02 20:53:37,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:37,944 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-11-02 20:53:37,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:37,945 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-11-02 20:53:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:53:37,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:37,946 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:37,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:53:37,946 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:37,947 INFO L85 PathProgramCache]: Analyzing trace with hash 280709232, now seen corresponding path program 1 times [2022-11-02 20:53:37,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:37,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093367871] [2022-11-02 20:53:37,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:37,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:37,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:38,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:38,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093367871] [2022-11-02 20:53:38,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093367871] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:38,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589679118] [2022-11-02 20:53:38,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:38,652 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:38,674 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:53:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:38,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-02 20:53:38,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:39,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:39,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:39,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:39,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:39,428 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:53:39,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 30 [2022-11-02 20:53:39,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-02 20:53:39,542 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-02 20:53:39,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:39,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589679118] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:39,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:53:39,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [16] total 26 [2022-11-02 20:53:39,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828914442] [2022-11-02 20:53:39,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:39,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:53:39,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:39,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:53:39,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2022-11-02 20:53:39,544 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 12 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:40,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:40,171 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2022-11-02 20:53:40,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:53:40,171 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 51 [2022-11-02 20:53:40,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:40,172 INFO L225 Difference]: With dead ends: 109 [2022-11-02 20:53:40,172 INFO L226 Difference]: Without dead ends: 109 [2022-11-02 20:53:40,173 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=110, Invalid=882, Unknown=0, NotChecked=0, Total=992 [2022-11-02 20:53:40,173 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 262 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:40,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 307 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:53:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-02 20:53:40,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2022-11-02 20:53:40,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 83 states have internal predecessors, (89), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:40,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2022-11-02 20:53:40,177 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 51 [2022-11-02 20:53:40,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:40,177 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2022-11-02 20:53:40,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.8) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-02 20:53:40,177 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2022-11-02 20:53:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-02 20:53:40,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:40,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:40,220 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:40,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:40,388 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:40,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash 280709233, now seen corresponding path program 1 times [2022-11-02 20:53:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:40,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505855109] [2022-11-02 20:53:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:40,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:40,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:40,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:41,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:41,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505855109] [2022-11-02 20:53:41,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505855109] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:41,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398603125] [2022-11-02 20:53:41,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:41,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:41,150 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:41,151 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:41,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:53:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:41,481 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:53:41,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:41,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-11-02 20:53:41,998 WARN L855 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_3335 (Array Int Int))) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_3335)))) is different from true [2022-11-02 20:53:42,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:42,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:53:42,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2022-11-02 20:53:42,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:42,213 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3340 (Array Int Int)) (|v_node_create_~temp~0#1.base_54| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_54| v_ArrVal_3340) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (<= (+ .cse0 1) 0) (not (< |v_node_create_~temp~0#1.base_54| |c_#StackHeapBarrier|)) (<= 1 .cse0)))) is different from false [2022-11-02 20:53:42,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398603125] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:42,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:42,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 26 [2022-11-02 20:53:42,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839387361] [2022-11-02 20:53:42,215 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:42,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-02 20:53:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:42,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-02 20:53:42,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=571, Unknown=2, NotChecked=98, Total=756 [2022-11-02 20:53:42,216 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:53:43,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:43,018 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2022-11-02 20:53:43,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:53:43,024 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 51 [2022-11-02 20:53:43,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:43,025 INFO L225 Difference]: With dead ends: 85 [2022-11-02 20:53:43,025 INFO L226 Difference]: Without dead ends: 85 [2022-11-02 20:53:43,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=161, Invalid=901, Unknown=2, NotChecked=126, Total=1190 [2022-11-02 20:53:43,026 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 343 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:43,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 584 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 419 Invalid, 0 Unknown, 86 Unchecked, 0.5s Time] [2022-11-02 20:53:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-11-02 20:53:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2022-11-02 20:53:43,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 80 states have internal predecessors, (85), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-02 20:53:43,028 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 51 [2022-11-02 20:53:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:43,029 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-02 20:53:43,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 22 states have internal predecessors, (67), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-02 20:53:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-02 20:53:43,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:53:43,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:43,029 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:43,071 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:43,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:43,252 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:43,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 869466270, now seen corresponding path program 1 times [2022-11-02 20:53:43,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:43,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412479643] [2022-11-02 20:53:43,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:43,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:43,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:43,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:43,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:43,444 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:53:43,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:43,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412479643] [2022-11-02 20:53:43,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412479643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:43,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:43,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:53:43,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408526242] [2022-11-02 20:53:43,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:43,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:43,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:43,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:43,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:43,447 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:53:43,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:43,650 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-11-02 20:53:43,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 20:53:43,651 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2022-11-02 20:53:43,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:43,651 INFO L225 Difference]: With dead ends: 102 [2022-11-02 20:53:43,652 INFO L226 Difference]: Without dead ends: 102 [2022-11-02 20:53:43,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:53:43,652 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 49 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:43,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 282 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:53:43,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-02 20:53:43,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 84. [2022-11-02 20:53:43,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 79 states have internal predecessors, (84), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2022-11-02 20:53:43,655 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 52 [2022-11-02 20:53:43,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:43,656 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2022-11-02 20:53:43,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:53:43,656 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2022-11-02 20:53:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-02 20:53:43,661 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:43,661 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:43,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:53:43,661 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:43,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:43,662 INFO L85 PathProgramCache]: Analyzing trace with hash 869466271, now seen corresponding path program 1 times [2022-11-02 20:53:43,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:43,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509986270] [2022-11-02 20:53:43,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:43,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:43,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:44,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:44,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:44,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:45,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:45,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509986270] [2022-11-02 20:53:45,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509986270] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:45,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812554923] [2022-11-02 20:53:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:45,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:45,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:45,653 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:45,672 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:53:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:45,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:53:45,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:46,082 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-02 20:53:46,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-02 20:53:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-11-02 20:53:46,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:53:46,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812554923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:46,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:53:46,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [19] total 23 [2022-11-02 20:53:46,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303774588] [2022-11-02 20:53:46,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:46,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:53:46,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:46,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:53:46,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2022-11-02 20:53:46,185 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:53:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:46,379 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2022-11-02 20:53:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:53:46,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 52 [2022-11-02 20:53:46,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:46,380 INFO L225 Difference]: With dead ends: 83 [2022-11-02 20:53:46,380 INFO L226 Difference]: Without dead ends: 83 [2022-11-02 20:53:46,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2022-11-02 20:53:46,381 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 52 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:46,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 249 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:53:46,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-11-02 20:53:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-11-02 20:53:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-02 20:53:46,386 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 52 [2022-11-02 20:53:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:46,387 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-02 20:53:46,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-02 20:53:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-02 20:53:46,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:53:46,388 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:46,388 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:46,420 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:46,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:46,604 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:46,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:46,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650644, now seen corresponding path program 1 times [2022-11-02 20:53:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:46,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418844099] [2022-11-02 20:53:46,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:46,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:47,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:47,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:47,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:48,449 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:53:48,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:48,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418844099] [2022-11-02 20:53:48,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418844099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:48,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537757091] [2022-11-02 20:53:48,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:48,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:48,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:48,452 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:48,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:53:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:48,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-02 20:53:48,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:48,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:49,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:49,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:49,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:49,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 14 [2022-11-02 20:53:49,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-02 20:53:49,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:49,909 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:53:49,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2022-11-02 20:53:49,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:49,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2022-11-02 20:53:49,959 INFO L356 Elim1Store]: treesize reduction 116, result has 32.2 percent of original size [2022-11-02 20:53:49,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 69 [2022-11-02 20:53:50,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 59 treesize of output 39 [2022-11-02 20:53:50,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:50,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:50,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 25 [2022-11-02 20:53:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:50,525 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:53:50,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4042 (Array Int Int)) (v_ArrVal_4043 (Array Int Int)) (|v_node_create_~temp~0#1.base_57| Int)) (or (= (select (store |c_#valid| |v_node_create_~temp~0#1.base_57| 1) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_57| v_ArrVal_4043))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_57| v_ArrVal_4042) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)))) 1) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_57|) 0)) (not (< |v_node_create_~temp~0#1.base_57| |c_#StackHeapBarrier|)))) is different from false [2022-11-02 20:53:50,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537757091] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:50,740 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:53:50,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 38 [2022-11-02 20:53:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332673207] [2022-11-02 20:53:50,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:53:50,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-02 20:53:50,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:50,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-02 20:53:50,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1516, Unknown=3, NotChecked=78, Total=1722 [2022-11-02 20:53:50,746 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 39 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 34 states have internal predecessors, (83), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:53:52,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:52,466 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2022-11-02 20:53:52,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:53:52,467 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 34 states have internal predecessors, (83), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2022-11-02 20:53:52,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:52,467 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:53:52,467 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:53:52,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 671 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=245, Invalid=2723, Unknown=6, NotChecked=106, Total=3080 [2022-11-02 20:53:52,469 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 39 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:52,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 867 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 688 Invalid, 0 Unknown, 119 Unchecked, 0.6s Time] [2022-11-02 20:53:52,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:53:52,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-02 20:53:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 77 states have internal predecessors, (82), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:53:52,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 88 transitions. [2022-11-02 20:53:52,472 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 88 transitions. Word has length 53 [2022-11-02 20:53:52,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:52,472 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 88 transitions. [2022-11-02 20:53:52,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 36 states have (on average 2.3055555555555554) internal successors, (83), 34 states have internal predecessors, (83), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-02 20:53:52,473 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 88 transitions. [2022-11-02 20:53:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-02 20:53:52,473 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:52,473 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:52,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:53:52,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-02 20:53:52,674 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:53:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:52,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1183650645, now seen corresponding path program 1 times [2022-11-02 20:53:52,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:52,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842845202] [2022-11-02 20:53:52,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:52,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:55,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:53:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:55,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:53:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:55,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:53:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:56,989 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:53:56,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:56,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842845202] [2022-11-02 20:53:56,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842845202] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:53:56,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144773755] [2022-11-02 20:53:56,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:56,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:53:56,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:53:56,993 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:53:57,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:53:57,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:57,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 101 conjunts are in the unsatisfiable core [2022-11-02 20:53:57,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:53:57,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:58,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:58,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:53:58,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:58,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:58,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 44 [2022-11-02 20:53:58,515 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:53:58,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 22 [2022-11-02 20:53:59,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:59,149 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:53:59,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 83 [2022-11-02 20:53:59,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:59,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:59,163 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:53:59,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 81 [2022-11-02 20:53:59,193 INFO L356 Elim1Store]: treesize reduction 34, result has 44.3 percent of original size [2022-11-02 20:53:59,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 34 treesize of output 36 [2022-11-02 20:53:59,213 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 44 [2022-11-02 20:53:59,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:53:59,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:53:59,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 50 [2022-11-02 20:53:59,737 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:53:59,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 25 [2022-11-02 20:53:59,920 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:53:59,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:00,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144773755] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:00,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:00,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 22] total 50 [2022-11-02 20:54:00,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409004362] [2022-11-02 20:54:00,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:00,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 20:54:00,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:00,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 20:54:00,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2896, Unknown=2, NotChecked=0, Total=3080 [2022-11-02 20:54:00,608 INFO L87 Difference]: Start difference. First operand 82 states and 88 transitions. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 44 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:54:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:04,522 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-11-02 20:54:04,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:54:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 44 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 53 [2022-11-02 20:54:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:04,524 INFO L225 Difference]: With dead ends: 81 [2022-11-02 20:54:04,524 INFO L226 Difference]: Without dead ends: 81 [2022-11-02 20:54:04,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=379, Invalid=5470, Unknown=3, NotChecked=0, Total=5852 [2022-11-02 20:54:04,526 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 230 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 182 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:04,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1063 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1385 Invalid, 0 Unknown, 182 Unchecked, 1.3s Time] [2022-11-02 20:54:04,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-02 20:54:04,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-11-02 20:54:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:54:04,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-11-02 20:54:04,529 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 53 [2022-11-02 20:54:04,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:04,529 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-11-02 20:54:04,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 44 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:54:04,529 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-11-02 20:54:04,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-02 20:54:04,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:04,530 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:04,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:04,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:54:04,731 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:54:04,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:04,731 INFO L85 PathProgramCache]: Analyzing trace with hash -939292313, now seen corresponding path program 1 times [2022-11-02 20:54:04,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:04,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950766182] [2022-11-02 20:54:04,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:08,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:08,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:08,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:08,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:54:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:09,150 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:54:09,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:09,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950766182] [2022-11-02 20:54:09,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950766182] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:09,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428835174] [2022-11-02 20:54:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:09,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:09,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:09,156 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:09,176 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:54:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:09,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 114 conjunts are in the unsatisfiable core [2022-11-02 20:54:09,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:09,593 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:09,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:09,790 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:54:09,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:09,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:10,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:10,619 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 20:54:10,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 16 [2022-11-02 20:54:10,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:11,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:11,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2022-11-02 20:54:11,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:11,296 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:54:11,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 47 [2022-11-02 20:54:11,313 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-02 20:54:11,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-11-02 20:54:12,502 INFO L356 Elim1Store]: treesize reduction 61, result has 17.6 percent of original size [2022-11-02 20:54:12,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 43 [2022-11-02 20:54:12,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2022-11-02 20:54:12,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:12,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:12,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2022-11-02 20:54:12,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:12,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-02 20:54:12,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:12,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 25 treesize of output 25 [2022-11-02 20:54:12,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:12,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:12,766 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:54:12,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 32 [2022-11-02 20:54:12,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:12,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-02 20:54:12,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:13,026 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:54:13,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 44 [2022-11-02 20:54:13,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:13,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 33 [2022-11-02 20:54:13,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 20 [2022-11-02 20:54:13,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-02 20:54:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:54:13,329 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:13,626 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4650 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-02 20:54:13,640 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:54:13,657 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4645) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-02 20:54:13,674 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (<= (+ 12 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select |c_#length| (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4643) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4645) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-11-02 20:54:13,703 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (<= (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4643) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4645) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (<= 0 (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))) is different from false [2022-11-02 20:54:13,734 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)))) (and (forall ((|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int)) (or (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (<= 0 (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))) (not (<= |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int)) (or (not (<= |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| |c_ULTIMATE.start_dll_circular_prepend_#t~mem13#1.base|)) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (<= (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4643) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4645) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))) is different from false [2022-11-02 20:54:13,783 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))) (.cse1 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (or (<= 0 (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) (< .cse1 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|))) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (or (<= (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4643) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4645) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< .cse1 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|)))))) is different from false [2022-11-02 20:54:13,819 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))) (.cse2 (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (or (<= (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4643) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4645) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< .cse2 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|))) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (or (<= 0 (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) |c_ULTIMATE.start_dll_circular_prepend_#t~mem12#1.base| v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) (< .cse2 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|)))))) is different from false [2022-11-02 20:54:13,856 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~mem11#1.offset| 4))) (.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (or (<= (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) .cse1 v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4643) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4645) .cse1 v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< .cse3 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|))) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (or (<= 0 (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) .cse1 v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) (< .cse3 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|)))))) is different from false [2022-11-02 20:54:13,890 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (or (<= 0 (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) .cse1 v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) (< .cse2 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|))) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (or (<= (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) .cse1 v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4643) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4645) .cse1 v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< .cse2 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|))))))) is different from false [2022-11-02 20:54:14,002 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$.base| .cse2) (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (and (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4648 (Array Int Int))) (or (<= 0 (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) .cse1 v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)) (< .cse2 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|))) (forall ((v_ArrVal_4650 (Array Int Int)) (v_ArrVal_4643 (Array Int Int)) (v_ArrVal_4644 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| Int) (v_ArrVal_4645 (Array Int Int)) (v_ArrVal_4646 (Array Int Int)) (v_ArrVal_4647 (Array Int Int)) (v_ArrVal_4648 (Array Int Int)) (v_ArrVal_4649 (Array Int Int))) (or (<= (+ (select (select (store (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4644) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4646) .cse1 v_ArrVal_4648) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4650) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 12) (select |c_#length| (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4643) |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9| v_ArrVal_4645) .cse1 v_ArrVal_4647) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4649) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (< .cse2 |v_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base_9|))))))) is different from false [2022-11-02 20:54:14,151 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:14,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 203 treesize of output 207 [2022-11-02 20:54:15,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [428835174] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:15,396 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-02 20:54:15,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 65 [2022-11-02 20:54:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069543595] [2022-11-02 20:54:15,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-02 20:54:15,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-11-02 20:54:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:54:15,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-11-02 20:54:15,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=4646, Unknown=13, NotChecked=1606, Total=6480 [2022-11-02 20:54:15,399 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 66 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 57 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:54:21,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:54:21,769 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-11-02 20:54:21,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-11-02 20:54:21,770 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 57 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 58 [2022-11-02 20:54:21,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:54:21,771 INFO L225 Difference]: With dead ends: 86 [2022-11-02 20:54:21,771 INFO L226 Difference]: Without dead ends: 86 [2022-11-02 20:54:21,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 108 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=486, Invalid=9244, Unknown=16, NotChecked=2244, Total=11990 [2022-11-02 20:54:21,776 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 186 mSDsluCounter, 1414 mSDsCounter, 0 mSdLazyCounter, 1949 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 2092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:54:21,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 1455 Invalid, 2092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1949 Invalid, 0 Unknown, 95 Unchecked, 1.7s Time] [2022-11-02 20:54:21,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-11-02 20:54:21,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-11-02 20:54:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 64 states have (on average 1.296875) internal successors, (83), 78 states have internal predecessors, (83), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-02 20:54:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2022-11-02 20:54:21,780 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 58 [2022-11-02 20:54:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:54:21,780 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2022-11-02 20:54:21,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 57 states have internal predecessors, (103), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-02 20:54:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2022-11-02 20:54:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-02 20:54:21,781 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:54:21,781 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:54:21,806 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-02 20:54:21,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-02 20:54:21,985 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 57 more)] === [2022-11-02 20:54:21,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:54:21,986 INFO L85 PathProgramCache]: Analyzing trace with hash -716779287, now seen corresponding path program 1 times [2022-11-02 20:54:21,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:54:21,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472432715] [2022-11-02 20:54:21,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:21,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:54:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 20:54:26,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-02 20:54:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:26,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-02 20:54:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:54:27,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:54:27,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472432715] [2022-11-02 20:54:27,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472432715] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:54:27,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797656898] [2022-11-02 20:54:27,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:54:27,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:54:27,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:54:27,476 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:54:27,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9e57b604-adba-4f67-9f16-afdd7325db2a/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-02 20:54:27,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:54:27,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 144 conjunts are in the unsatisfiable core [2022-11-02 20:54:27,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:54:27,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:28,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-02 20:54:28,244 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:54:28,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:28,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:54:28,529 INFO L356 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-02 20:54:28,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-02 20:54:29,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-02 20:54:29,446 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-02 20:54:29,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 26 [2022-11-02 20:54:29,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-11-02 20:54:29,943 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:30,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:30,290 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:54:30,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 73 [2022-11-02 20:54:30,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:30,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 66 treesize of output 64 [2022-11-02 20:54:30,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:30,333 INFO L356 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-11-02 20:54:30,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 39 [2022-11-02 20:54:32,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 67 [2022-11-02 20:54:32,027 INFO L356 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2022-11-02 20:54:32,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 94 treesize of output 46 [2022-11-02 20:54:32,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:32,054 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:54:32,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:32,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:32,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:32,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:54:32,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:32,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2022-11-02 20:54:32,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 47 [2022-11-02 20:54:32,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:32,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:54:32,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 12 [2022-11-02 20:54:32,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:32,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-11-02 20:54:32,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:54:33,066 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:54:33,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 68 treesize of output 63 [2022-11-02 20:54:33,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:33,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2022-11-02 20:54:33,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:54:33,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-11-02 20:54:33,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 18 [2022-11-02 20:54:33,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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-02 20:54:33,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:54:33,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:33,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 10 [2022-11-02 20:54:33,624 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-02 20:54:33,624 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:54:33,816 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4982 (Array Int Int)) (v_ArrVal_4983 (Array Int Int)) (v_ArrVal_4981 Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4981)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4982) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4983) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-11-02 20:54:33,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4982 (Array Int Int)) (v_ArrVal_4983 (Array Int Int)) (v_ArrVal_4981 Int) (v_ArrVal_4978 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4980))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4981))) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4979) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4982) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4978) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4983) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-02 20:54:33,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4982 (Array Int Int)) (v_ArrVal_4983 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4981 Int) (v_ArrVal_4976 (Array Int Int)) (v_ArrVal_4977 (Array Int Int)) (v_ArrVal_4978 (Array Int Int)) (v_ArrVal_4979 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4975) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4980))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_4981))) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4977) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4979) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4982) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~old_head~0#1.base| v_ArrVal_4976) |c_ULTIMATE.start_dll_circular_prepend_~last~1#1.base| v_ArrVal_4978) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_4983) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))) is different from false [2022-11-02 20:54:36,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4973 Int) (v_ArrVal_4981 Int) (v_ArrVal_4980 (Array Int Int)) (v_ArrVal_4982 (Array Int Int)) (v_ArrVal_4972 (Array Int Int)) (v_ArrVal_4983 (Array Int Int)) (v_ArrVal_4974 (Array Int Int)) (v_ArrVal_4975 (Array Int Int)) (v_ArrVal_4976 (Array Int Int)) (v_ArrVal_4977 (Array Int Int)) (v_ArrVal_4978 (Array Int Int)) (v_ArrVal_4968 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_23| Int) (v_ArrVal_4979 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_23|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse5 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse2) (+ (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (select (select (let ((.cse0 (store (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_4968))) (store .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_23| v_ArrVal_4973))) .cse2 v_ArrVal_4975) .cse3 v_ArrVal_4980))) (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_23| 4) v_ArrVal_4981))) (select (select (store (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4972) .cse2 v_ArrVal_4977) .cse3 v_ArrVal_4979) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4982) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_23|)) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4974) .cse2 v_ArrVal_4976) .cse3 v_ArrVal_4978) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_4983) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8)))))) (not (<= |v_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset_23| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)))) is different from false [2022-11-02 20:54:36,451 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:36,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 279 treesize of output 250 [2022-11-02 20:54:36,542 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:54:36,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 952556 treesize of output 943590 [2022-11-02 20:54:37,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1095578 treesize of output 954266 [2022-11-02 20:54:39,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1030298 treesize of output 959642 [2022-11-02 20:54:40,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1024090 treesize of output 1001306